Complexity of Toeplitz sequences

DOI10.1016/S0012-365X(96)00077-5zbMath0895.11011MaRDI QIDQ1382825

Michel Koskas

Publication date: 20 September 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

periodic sequencesToeplitz sequencesblock complexityentropy of sequences

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Related Items (14)

On a conjecture on bidimensional words. ⋮ About the \(p\)-paperfolding words ⋮ Words with unbounded periodicity complexity ⋮ Combinatorics of one-dimensional simple Toeplitz subshifts ⋮ On the structure of generic subshifts ⋮ Constructing partial words with subword complexities not achievable by full words ⋮ On possible growths of Toeplitz languages ⋮ ALGORITHMIC COMBINATORICS ON PARTIAL WORDS ⋮ Sequences of linear arithmetical complexity ⋮ Language structure of pattern Sturmian words ⋮ On the infinite permutation generated by the period doubling word ⋮ Uniform sets and complexity ⋮ On possible growths of arithmetical complexity ⋮ Sequences of low arithmetical complexity

Cites Work

• Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
• Toeplitz sequences, paperfolding, towers of Hanoi and progression-free sequences of integers
• The tower of Hanoi
• Enumeration of factors in the Thue-Morse word
• Tours de Hanoï et automates
• Le p-pliage de papier
• The number of factors in a paperfolding sequence
• Sequences with minimal block growth
• Symbolic Dynamics II. Sturmian Trajectories

This page was built for publication: Complexity of Toeplitz sequences