A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Constructions with Countable Subshifts of Finite Type
Tekijät: Ville Salo, Ilkka Törmä
Kustantaja: IOS Press
Julkaisuvuosi: 2013
Journal: Fundamenta Informaticae
Lehden akronyymi: FI
Artikkelin numero: 8
Numero sarjassa: 2-3
Vuosikerta: 126
Numero: 2-3
Aloitussivu: 263
Lopetussivu: 300
Sivujen määrä: 38
ISSN: 1875-8681
eISSN: 1875-8681
DOI: https://doi.org/10.3233/FI-2013-881
Tiivistelmä
We present constructions of countable two-dimensional subshifts of finite type (SFTs) with interesting properties. Our main focus is on properties of the topological derivatives and subpattern posets of these objects. We present a countable SFT whose iterated derivatives are maximally complex from the computational point of view, constructions of countable SFTs with high Cantor-Bendixson ranks, a countable SFT whose subpattern poset contains an infinite descending chain and a countable SFT whose subpattern poset contains all finite posets. When possible, we make these constructions deterministic, and ensure the sets of rows are very simple as one-dimensional subshifts.
We present constructions of countable two-dimensional subshifts of finite type (SFTs) with interesting properties. Our main focus is on properties of the topological derivatives and subpattern posets of these objects. We present a countable SFT whose iterated derivatives are maximally complex from the computational point of view, constructions of countable SFTs with high Cantor-Bendixson ranks, a countable SFT whose subpattern poset contains an infinite descending chain and a countable SFT whose subpattern poset contains all finite posets. When possible, we make these constructions deterministic, and ensure the sets of rows are very simple as one-dimensional subshifts.
Ladattava julkaisu This is an electronic reprint of the original article. |  |
Turun yliopiston Tutkimustietojärjestelmän portaali