Maximal pattern complexity of words over \(\ell\) letters
From MaRDI portal
Publication:2581466
DOI10.1016/j.ejc.2004.07.006zbMath1082.68090MaRDI QIDQ2581466
Publication date: 10 January 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2004.07.006
68R15: Combinatorics on words
Related Items
Abelian maximal pattern complexity of words, Abelian combinatorics on words: a survey, Maximal pattern complexity, dual system and pattern recognition, Behavior of various complexity functions, Uniform sets and complexity, Language structure of pattern Sturmian words, Maximal pattern complexity of two-dimensional words, Partitions by congruent sets and optimal positions, Uniform sets and super-stationary sets over general alphabets, On possible growths of arithmetical complexity, Sturmian and Episturmian Words
Cites Work