Language structure of pattern Sturmian words

DOI10.1016/j.disc.2006.03.043zbMath1097.68111OpenAlexW2149259132MaRDI 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 complexitylanguage structurepattern Sturmian word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (9)

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Language structure of pattern Sturmian words