2008/01/31 by Amy Glen, Jacques Justin · 2 citations
Computer Science · Mathematics · #cs.DM #math.CO #msc:68R15
paper · pdf · doi:10.1051/ita/2009003
published as RAIRO - Theoretical Informatics and Applications 43 (2009) 402-433 · 36 pages; major revision: improvements + new material + more references
arxiv created 2008/09/17 · arxiv updated 2010/03/16
In this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two letters. After recalling definitions and basic properties, we consider episturmian morphisms that allow for a deeper study of these words. Some properties of factors are described, including factor complexity, palindromes, fractional powers, frequencies, and return words. We also consider lexicographical properties of episturmian words, as well as their connection to the balance property, and related notions such as finite episturmian words, Arnoux-Rauzy sequences, and "episkew words" that generalize the skew words of Morse and Hedlund.