• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Constructions with Countable Subshifts of Finite Type

Ville Salo, Ilkka Törmä, Constructions with Countable Subshifts of Finite Type. Fundamenta Informaticae 126(2-3), 263–300, 2013.

http://dx.doi.org/10.3233/FI-2013-881

Abstract:

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.

BibTeX entry:

@ARTICLE{jSaTx13a,
  title = {Constructions with Countable Subshifts of Finite Type},
  author = {Salo, Ville and Törmä, Ilkka},
  journal = {Fundamenta Informaticae},
  volume = {126},
  number = {2-3},
  publisher = {IOS Press},
  pages = {263–300},
  year = {2013},
  keywords = {countable subshifts, Cantor-Bendixson rank, subpattern poset},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Publication Forum rating of this publication: level 2

Edit publication