Behavior of various complexity functions
From MaRDI portal
Publication:764361
DOI10.1016/J.TCS.2011.11.012zbMath1260.68312OpenAlexW1980974263MaRDI QIDQ764361
Publication date: 13 March 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.11.012
Combinatorics on words (68R15) Formal languages and automata (68Q45) Topological entropy (37B40) Symbolic dynamics (37B10)
Related Items (4)
Three complexity functions ⋮ Maximal pattern complexity, dual system and pattern recognition ⋮ Complexity of Leading Digit Sequences ⋮ Central sets generated by uniformly recurrent words
Cites Work
- Substitutions in dynamics, arithmetics and combinatorics
- Maximal pattern complexity, dual system and pattern recognition
- Combinatorial lemmas and applications to dynamics
- Uniform sets and complexity
- Super-stationary set, subword problem and the complexity
- Language structure of pattern Sturmian words
- Maximal pattern complexity of two-dimensional words
- Maximal pattern complexity of words over \(\ell\) letters
- Three complexity functions
- Partitions by congruent sets and optimal positions
- Uniform sets and super-stationary sets over general alphabets
- On maximal pattern complexity of some automatic words
- Sequence entropy and the maximal pattern complexity of infinite words
- Maximal pattern complexity for discrete systems
This page was built for publication: Behavior of various complexity functions
