Publication:4784598
From MaRDI portal
zbMath1136.68302MaRDI QIDQ4784598
Publication date: 11 December 2002
68R15: Combinatorics on words
20M05: Free semigroups, generators and relations, word problems
68-02: Research exposition (monographs, survey articles) pertaining to computer science
11B85: Automata sequences
Related Items
The complexity of Fibonacci-like kneading sequences, Languages under substitutions and balanced words, Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\)., A note on the Markov condition and central words, On Markoff's property and Sturmian words, An isolated point in the Heinis spectrum, Combinatoire de mots récurrents de complexitén+2