A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Countable Sofic Shifts with a Periodic Direction
Tekijät: Törmä I
Kustantaja: SPRINGER
Julkaisuvuosi: 2020
Journal: Theory of Computing Systems
Tietokannassa oleva lehden nimi: THEORY OF COMPUTING SYSTEMS
Lehden akronyymi: THEOR COMPUT SYST
Vuosikerta: 64
Numero: 6
Aloitussivu: 1042
Lopetussivu: 1066
Sivujen määrä: 25
ISSN: 1432-4350
eISSN: 1433-0490
DOI: https://doi.org/10.1007/s00224-019-09962-8
Rinnakkaistallenteen osoite: https://research.utu.fi/converis/portal/detail/Publication/44230050
Tiivistelmä
As a variant of the equal entropy cover problem, we ask whether all multidimensional sofic shifts with countably many configurations have SFT covers with countably many configurations. We answer this question in the negative by presenting explicit counterexamples. We formulate necessary conditions for a vertically periodic shift space to have a countable SFT cover, and prove that they are sufficient in a natural (but quite restricted) subclass of shift spaces.
As a variant of the equal entropy cover problem, we ask whether all multidimensional sofic shifts with countably many configurations have SFT covers with countably many configurations. We answer this question in the negative by presenting explicit counterexamples. We formulate necessary conditions for a vertically periodic shift space to have a countable SFT cover, and prove that they are sufficient in a natural (but quite restricted) subclass of shift spaces.
Ladattava julkaisu This is an electronic reprint of the original article. |  |
Turun yliopiston Tutkimustietojärjestelmän portaali