Language structure of pattern Sturmian words
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 2087492 (Why is no real title available?)
- *-Sturmian words and complexity
- Complexity of Toeplitz sequences
- Complexity of sequences and dynamical systems
- Maximal pattern complexity for Toeplitz words
- Maximal pattern complexity for discrete systems
- Maximal pattern complexity of two-dimensional words
- Maximal pattern complexity of words over \(\ell\) letters
- Palindrome complexity.
- Sequence entropy and the maximal pattern complexity of infinite words
- Sequences of linear arithmetical complexity
- Substitutions in dynamics, arithmetics and combinatorics
- Toeplitz words, generalized periodicity and periodically iterated morphisms
Cited in
(12)- Periodic and Sturmian languages
- Maximal pattern complexity, dual system and pattern recognition
- Behavior of various complexity functions
- Super-stationary set, subword problem and the complexity
- Uniform sets and complexity
- Uniform sets and super-stationary sets over general alphabets
- Maximal pattern complexity of higher dimensional words
- Properties of a class of Toeplitz words
- Partitions by congruent sets and optimal positions
- Introducing privileged words: privileged complexity of Sturmian words
- Sturmian and Episturmian Words
- Infinite permutations of lowest maximal pattern complexity
This page was built for publication: Language structure of pattern Sturmian words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2502894)
