221 search results - page 1 / 45 » Periodic and Sturmian languages |
IPL
2006
13 years 5 months ago
2006
Counting the number of distinct factors in the words of a language gives a measure of complexity for that language similar to the factor-complexity of infinite words. Similarly as ...
DM
2006
13 years 5 months ago
2006
Pattern Sturmian words introduced by Kamae and Zamboni KZ1, KZ2] are an analogy of Sturmian words for the maximal pattern complexity instead of the block complexity. So far, two k...
MST
2010
13 years 3 months ago
2010
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words,...
COMBINATORICS
2007
13 years 5 months ago
2007
It is well-known that Sturmian sequences are the non ultimately periodic sequences that are balanced over a 2-letter alphabet. They are also characterized by their complexity: the...
DAM
2011
13 years 8 days 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...