Decidability and universality of quasiminimal subshifts
: Salo V
Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCE
: 2017
: Journal of Computer and System Sciences
: JOURNAL OF COMPUTER AND SYSTEM SCIENCES
: J COMPUT SYST SCI
: 89
: 288
: 314
: 27
: 0022-0000
DOI: https://doi.org/10.1016/j.jcss.2017.05.017
: https://research.utu.fi/converis/portal/detail/Publication/29269452
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.
UTU Research Portal