Characterization of circular D0L-systems
From MaRDI portal
Abstract: We prove that every non-circular D0L system contains arbitrarily long repetitions. This result was already published in 1993 by Mignosi and S'e'ebold, however their proof is only a sketch. We give here a complete proof. Further, employing our previous result, we give a simple algorithm to test circularity of an injective D0L system.
Recommendations
- scientific article; zbMATH DE number 4042105
- Circularly ordered dynamical systems
- A model for determining the set of characterization of D-systems
- Circular criteria for linear systems
- A characterization of the circular disc
- Circular distributions and Euler systems
- scientific article; zbMATH DE number 4019893
- From odometers to circular systems: a global structure theorem
- Besicovitch-Danzer-type characterization of a circle
- scientific article; zbMATH DE number 5079109
Cites work
- An algorithm for enumerating all infinite repetitions in a D0L-system
- Elementary homomorphisms and a solution of the DOL sequence equivalence problem
- scientific article; zbMATH DE number 3569855 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 2042127 (Why is no real title available?)
- If a DOL language is k-power free then it is circular
- Periodicity and ultimate periodicity of D0L systems
- Reconnaissabilité des substitutions et complexité des suites automatiques
- Repetition of subwords in DOL languages
- Repetitiveness of languages generated by morphisms
Cited in
(12)- Morphic words and equidistributed sequences
- Repetition of subwords in DOL languages
- scientific article; zbMATH DE number 176927 (Why is no real title available?)
- Bispecial factors in circular non-pushy D0L languages
- Automatic sequences of rank two
- Recognizability for sequences of morphisms
- Substitution-dynamics and invariant measures for infinite alphabet-path space
- The number of primitive words of unbounded exponent in the language of an HD0L-system is finite
- Renormalization operator for substitutions
- Circularity and repetitiveness in non-injective DF0L systems
- Morphisms and BWT-run sensitivity
- Synchronizing delay for binary uniform morphisms
This page was built for publication: Characterization of circular D0L-systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272391)
