Abstract
We present two constructions of infinite words with a complexityfunction that grows faster than any polynomial, but slower thanany exponential. The first one is rather simple but produces a word whichis not uniformly recurrent. The second construction, more involved, producesuniformly recurrent words and allows to choose the growth of thecomplexity function in a large family.
Cite
CITATION STYLE
Cassaigne, J. (2003). Constructing infinite words of intermediate complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2450, pp. 173–184). Springer Verlag. https://doi.org/10.1007/3-540-45005-x_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
