Sciweavers

14 search results - page 1 / 3
» Variable Automata over Infinite Alphabets
Sort
View
LATA
2010
Springer
13 years 7 months ago
Variable Automata over Infinite Alphabets
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...
Sarai Sheinvald, Orna Grumberg, Orna Kupferman
BIRTHDAY
2008
Springer
13 years 5 months ago
Tree Automata over Infinite Alphabets
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 ...
Michael Kaminski, Tony Tan
CSL
2006
Springer
13 years 3 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
FUIN
2010
98views more  FUIN 2010»
13 years 1 months ago
A Note on Two-pebble Automata Over Infinite Alphabets
It is shown that the emptiness problem for 2-PA languages is undecidable and that 2-PA are weaker than 3-PA.
Michael Kaminski, Tony Tan
FOSSACS
2008
Springer
13 years 5 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
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 ...
Hermann Gruber, Jan Johannsen