34 search results - page 1 / 7 » A characterization of fine words over a finite alphabet |
TCS
2008
13 years 7 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...
TCS
2008
13 years 7 months ago
2008
The stabilizer of an infinite word w over a finite alphabet is the monoid of morphisms over that fix w. In this paper we study various problems related to stabilizers and their g...
CSL
2006
Springer
13 years 7 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...
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 ...
DAGSTUHL
2006
13 years 8 months ago
2006
We examine finite words over an alphabet = {a,