Complexity of Toeplitz sequences
From MaRDI portal
Recommendations
Cites work
- Enumeration of factors in the Thue-Morse word
- Le p-pliage de papier
- Sequences with minimal block growth
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Symbolic Dynamics II. Sturmian Trajectories
- The number of factors in a paperfolding sequence
- The tower of Hanoi
- Toeplitz sequences, paperfolding, towers of Hanoi and progression-free sequences of integers
- Tours de Hanoï et automates
Cited in
(17)- On possible growths of Toeplitz languages
- Sequences of linear arithmetical complexity
- Algorithmic combinatorics on partial words
- Combinatorics of one-dimensional simple Toeplitz subshifts
- Constructing partial words with subword complexities not achievable by full words
- On the infinite permutation generated by the period doubling word
- Uniform sets and complexity
- On a conjecture on bidimensional words.
- Complexity of finite sequences of zeros and ones and geometry of finite spaces of functions
- Words with unbounded periodicity complexity
- Language structure of pattern Sturmian words
- On possible growths of arithmetical complexity
- About the p-paperfolding words
- Toeplitz sequences of intermediate complexity
- Complexity of Hartman sequences
- Sequences of low arithmetical complexity
- On the structure of generic subshifts
This page was built for publication: Complexity of Toeplitz sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382825)
