Search:

Sturmian and Episturmian Words

A "word" here is an infinite sequences of letters, usually from a finite alphabet. "Sturmian" and "episturmian" are defined in terms of complexity of the sequence, where "complexity" is in turn defined in terms of the finite subsequences of the sequence. A good introduction to this can be found at

http://congres-math.univ-mlv.fr/sites/congres-math.univ-mlv.fr/files/Arnoux.pdf

and

http://www-igm.univ-mlv.fr/~berstel/Articles/2007SturmianThessalonique.pdf

Print - Search
Page last modified on July 31, 2013, at 07:32 AM