A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Decidability and universality of quasiminimal subshifts
Tekijät: Salo V
Kustantaja: ACADEMIC PRESS INC ELSEVIER SCIENCE
Julkaisuvuosi: 2017
Journal: Journal of Computer and System Sciences
Tietokannassa oleva lehden nimi: JOURNAL OF COMPUTER AND SYSTEM SCIENCES
Lehden akronyymi: J COMPUT SYST SCI
Vuosikerta: 89
Aloitussivu: 288
Lopetussivu: 314
Sivujen määrä: 27
ISSN: 0022-0000
DOI: https://doi.org/10.1016/j.jcss.2017.05.017
Rinnakkaistallenteen osoite: https://research.utu.fi/converis/portal/detail/Publication/29269452
Tiivistelmä
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.
Ladattava julkaisu This is an electronic reprint of the original article. |  |
Turun yliopiston Tutkimustietojärjestelmän portaali