A1 Refereed original research article in a scientific journal
Decidability and universality of quasiminimal subshifts
Authors: Salo V
Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCE
Publication year: 2017
Journal: Journal of Computer and System Sciences
Journal name in source: JOURNAL OF COMPUTER AND SYSTEM SCIENCES
Journal acronym: J COMPUT SYST SCI
Volume: 89
First page : 288
Last page: 314
Number of pages: 27
ISSN: 0022-0000
DOI: https://doi.org/10.1016/j.jcss.2017.05.017
Self-archived copy’s web address: https://research.utu.fi/converis/portal/detail/Publication/29269452
Abstract
We introduce quasiminimal subshifts, subshifts having only finitely many subsystems. With N-actions, their theory essentially reduces to the theory of minimal systems, but with Z-actions, the class is much larger. We show many examples of such subshifts, and in particular construct a universal system with only a single proper subsystem, refuting a conjecture of [3]. (C) 2017 Elsevier Inc. All rights reserved.
We introduce quasiminimal subshifts, subshifts having only finitely many subsystems. With N-actions, their theory essentially reduces to the theory of minimal systems, but with Z-actions, the class is much larger. We show many examples of such subshifts, and in particular construct a universal system with only a single proper subsystem, refuting a conjecture of [3]. (C) 2017 Elsevier Inc. All rights reserved.
Downloadable publication This is an electronic reprint of the original article. |  |
UTU Research Portal