Sciweavers

433 search results - page 5 / 87
» On stabilizers of infinite words
Sort
View
CORR
2006
Springer
131views Education» more  CORR 2006»
13 years 8 months ago
Sequences with constant number of return words
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...
Lubomíra Balková, Edita Pelantov&aac...
CSL
2006
Springer
13 years 8 months ago
Automata and Logics for Words and Trees over an Infinite Alphabet
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...
Luc Segoufin
TCS
2010
13 years 2 months ago
Factorization forests for infinite words and applications to countable scattered linear orderings
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...
Thomas Colcombet
FCT
2007
Springer
13 years 11 months ago
Factorisation Forests for Infinite Words
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...
Thomas Colcombet
STACS
2009
Springer
14 years 2 months ago
Fragments of First-Order Logic over Infinite Words
Volker Diekert, Manfred Kufleitner