Uniform sets and super-stationary sets over general alphabets

DOI10.1017/S014338571000074XMaRDI QIDQ3093791zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Super-stationary set, subword problem and the complexity
• Uniform sets and complexity
• Waiting time distribution for the emergence of superpatterns
• Uniform words
• On automaton determinisation of sets of superwords

Cites work

• Language structure of pattern Sturmian words
• Maximal pattern complexity for Toeplitz words
• Maximal pattern complexity of two-dimensional words
• Maximal pattern complexity of words over \(\ell\) letters
• Super-stationary set, subword problem and the complexity
• Uniform sets and complexity

Cited in

(7)

• Uniform sets and complexity
• Super-stationary set, subword problem and the complexity
• Ultragraphs and shift spaces over infinite alphabets
• Abelian maximal pattern complexity of words
• Central sets generated by uniformly recurrent words
• Maximal pattern complexity, dual system and pattern recognition
• Behavior of various complexity functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093791)