Uniform sets and super-stationary sets over general alphabets
From MaRDI portal
Publication:3093791
DOI10.1017/S014338571000074XzbMath1226.68076MaRDI QIDQ3093791
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
Related Items
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
Cites Work