3 search results - page 1 / 1 » On Sturmian graphs |
DAM
2007
13 years 4 months ago
2007
In this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conj...
STRINGOLOGY
2008
13 years 6 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
DAM
2011
12 years 12 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...