27 search results - page 1 / 6 » On Pebble Automata for Data Languages with Decidable Emptine... |
MFCS
2009
Springer
15 years 22 days ago
2009
Springer
In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we show that the emptiness problem for weak 2-peb...
PODS
2007
ACM
15 years 6 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
ICALP
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
LICS
2010
IEEE
14 years 4 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
ICALP
2009
Springer
15 years 6 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...