On maximal pattern complexity of some automatic words
From MaRDI portal
Publication:3093792
DOI10.1017/S0143385710000453zbMath1226.68077MaRDI QIDQ3093792
Publication date: 18 October 2011
Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)
Related Items
Maximal pattern complexity, dual system and pattern recognition, Behavior of various complexity functions
Cites Work
- Complexity of sequences and dynamical systems
- Toeplitz words, generalized periodicity and periodically iterated morphisms
- Arithmetical complexity of symmetric D0L words.
- Sequences of low arithmetical complexity
- Automatic Sequences
- Maximal pattern complexity for Toeplitz words
- 0-1-sequences of Toeplitz type