Random generation of finite Sturmian wor
โ
Jean Berstel; Michel Pocchiola
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 521 KB
We present a bijection between the set of factors of given length of Sturmian words and some set of triples of nonnegative integers. This bijection and its inverse are both computable in linear time. Its applications are: a bijective proof of Mignosi's formula for counting Sturmian words, a linear p