48 search results - page 1 / 10 » Rankers over Infinite Words |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
TCS
2008
13 years 5 months ago
2008
To any infinite word t over a finite alphabet A we can associate two infinite words min(t) and max(t) such that any prefix of min(t) (resp. max(t)) is the lexicographically smalle...
CSL
2006
Springer
13 years 5 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...
STACS
2009
Springer
14 years 3 days ago
2009
Springer
DM
2010
13 years 5 months ago
2010
An infinite word is S-automatic if, for all n 0, its (n+1)st letter is the output of a deterministic automaton fed with the representation of n in the numeration system S. In this...