16 search results - page 1 / 4 » Tree Automata over Infinite Alphabets |
BIRTHDAY
2008
Springer
14 years 25 days ago
2008
Springer
A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare ...
CSL
2006
Springer
13 years 11 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...
LATA
2010
Springer
14 years 3 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...
FUIN
2010
13 years 8 months ago
2010
It is shown that the emptiness problem for 2-PA languages is undecidable and that 2-PA are weaker than 3-PA.
FOSSACS
2008
Springer
14 years 12 days ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...