Arithmetical complexity of symmetric D0L words.
From MaRDI portal
Publication:1426472
DOI10.1016/S0304-3975(03)00345-1zbMath1070.68068MaRDI QIDQ1426472
Publication date: 14 March 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (12)
On the arithmetical complexity of Sturmian words ⋮ Monochromatic arithmetic progressions in automatic sequences with group structure ⋮ On possible growths of Toeplitz languages ⋮ Sequences of linear arithmetical complexity ⋮ Subword complexity of uniform D0L words over finite groups ⋮ On the D0L Repetition Threshold ⋮ Constructing Infinite Words of Intermediate Arithmetical Complexity ⋮ Asymptotic subword complexity of fixed points of group substitutions ⋮ On maximal pattern complexity of some automatic words ⋮ On possible growths of arithmetical complexity ⋮ Sequences of low arithmetical complexity ⋮ Monochromatic arithmetic progressions in binary Thue-Morse-like words
Cites Work
- Subword complexities of various classes of deterministic developmental languages without interactions
- Modified complexity and *-Sturmian word
- Complexity of sequences and dynamical systems
- Automatic Sequences
- Sequence entropy and the maximal pattern complexity of infinite words
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Arithmetical complexity of symmetric D0L words.
