Uniform sets and super-stationary sets over general alphabets

DOI10.1017/S014338571000074XzbMath1226.68076OpenAlexW2128501256MaRDI QIDQ3093791

Teturo Kamae

Publication date: 18 October 2011

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s014338571000074x

Mathematics Subject Classification ID

Combinatorics on words (68R15) Symbolic dynamics (37B10)

Related Items (4)

Abelian maximal pattern complexity of words ⋮ Maximal pattern complexity, dual system and pattern recognition ⋮ Behavior of various complexity functions ⋮ Central sets generated by uniformly recurrent words

Cites Work

• 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
• Maximal pattern complexity for Toeplitz words

This page was built for publication: Uniform sets and super-stationary sets over general alphabets