433 search results - page 5 / 87 » On stabilizers of infinite words |
72
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
An infinite word has the property Rm if every factor has exactly m return words. Vuillon showed that R2 characterizes Sturmian words. We prove that a word satisfies Rm if its compl...
CSL
2006
Springer
14 years 9 months ago
2006
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
TCS
2010
14 years 4 months ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
FCT
2007
Springer
15 years 1 months ago
2007
Springer
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
