Paper Info
Title
On the number of factors of Sturmian words
Abstract
We prove that for m ⩾1, card( A m ) = 1+∑ m i =1 ( m − i +1) ϕ ( i ) where A m is the set of factors of length m of all the Sturmian words and ϕ is the Euler function. This result was conjectured by Dulucq and Gouyou-Beauchamps (1987) who proved that this result implies that the language (∪ m ⩾0 A m ) c is inherently ambiguous. We also give a combinatorial version of the Riemann hypothesis.
Year
DOI
Venue
1991
10.1016/0304-3975(91)90172-X
Theor. Comput. Sci.
Keywords
DocType
Volume
Sturmian word
Journal
82
Issue
ISSN
Citations 
1
Theoretical Computer Science
56
PageRank 
References 
Authors
13.09
2
1
Name
Order
Citations
PageRank
Filippo Mignosi156999.71