2017
DOI: 10.1016/j.jcss.2017.05.017
|View full text |Cite
|
Sign up to set email alerts
|

Decidability and universality of quasiminimal subshifts

Abstract: We introduce the 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 [Delvenne, Kůrka, Blondel, '05].5 The one-point subshift is the simplest minimal subshift, but any minimal subshift can be used here, though natura… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…The following result already appeared in [15], but an erratum clarified that some cases were not covered [16]. It is a parallel to a result in [5].…”
Section: The Problem Of the Purely Substitutive Walkmentioning
confidence: 96%
See 1 more Smart Citation
“…The following result already appeared in [15], but an erratum clarified that some cases were not covered [16]. It is a parallel to a result in [5].…”
Section: The Problem Of the Purely Substitutive Walkmentioning
confidence: 96%
“…Carton and Thomas provided a method to decide this question in the case of substitutive or morphic words on Büchi ω-automata, using verification theory and semigroups of congruence [5]. This result was partially reproved by Salo [15], using a more combinatorial point of view. For the last 20 years, the substitutive approach (iterating a single homomorphism) has been generalized to the S-adic approach [6] that lets one alternate betweeen multiple substitutions.…”
Section: Introductionmentioning
confidence: 99%
“…Quasiminimal shifts We now investigate the question of whether a substitution shift has a finite number of subshifts. Following the terminology introduced in [26] these shifts are called quasiminimal .…”
Section: Irreducible Substitution Shiftsmentioning
confidence: 99%
“…We assume familiarity with the process of constructing all words in the orbit closure of the ruler sequence, and how it manifests for subshifts based on the sequence, see e.g. [12].…”
Section: The Positioned Words Overmentioning
confidence: 99%