48 search results - page 3 / 10 » Rankers over Infinite Words |
TCS
2010
13 years 2 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...
AML
2004
13 years 7 months ago
2004
We examine the Dual Ramsey Theorem and two related combinatorial principles VW(k, l) and OVW(k, l) from the perspectives of reverse mathematics and effective mathematics. We give a...
ITA
2008
13 years 7 months ago
2008
We prove two cases of a strong version of Dejean's conjecture involving extremal letter frequencies. The results are that there exist an infinite " 5 4 + " -free wor...
LATA
2010
Springer
13 years 12 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...