Language structure of pattern Sturmian words

DOI10.1016/j.disc.2006.03.043zbMath1097.68111MaRDI QIDQ2502894

Bo Tan, Hui Rao, Yu-Mei Xue, Teturo Kamae

Publication date: 13 September 2006

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.043

zbMATH Keywords

uniform complexity; language structure; pattern Sturmian word

Mathematics Subject Classification ID

68R15: Combinatorics on words

Related Items

Infinite permutations of lowest maximal pattern complexity, Maximal pattern complexity, dual system and pattern recognition, Behavior of various complexity functions, Maximal pattern complexity of higher dimensional words, Uniform sets and complexity, Super-stationary set, subword problem and the complexity, Partitions by congruent sets and optimal positions, Uniform sets and super-stationary sets over general alphabets, Sturmian and Episturmian Words

Cites Work

• Unnamed Item
• Unnamed Item
• Sequences of linear arithmetical complexity
• *-Sturmian words and complexity
• Substitutions in dynamics, arithmetics and combinatorics
• Complexity of sequences and dynamical systems
• Toeplitz words, generalized periodicity and periodically iterated morphisms
• Complexity of Toeplitz sequences
• Palindrome complexity.
• Maximal pattern complexity of two-dimensional words
• Maximal pattern complexity of words over \(\ell\) letters
• Sequence entropy and the maximal pattern complexity of infinite words
• Maximal pattern complexity for discrete systems
• Maximal pattern complexity for Toeplitz words