Emptiness of Zero Automata Is Decidable
نویسندگان
چکیده
Zero automata are a probabilistic extension of parity automata on infinite trees. The satisfiability of a certain probabilistic variant of mso, called tmso + zero, reduces to the emptiness problem for zero automata. We introduce a variant of zero automata called nonzero automata. We prove that for every zero automaton there is an equivalent nonzero automaton of quadratic size and the emptiness problem of nonzero automata is decidable, with complexity co-np. These results imply that tmso + zero has decidable satisfiability. 1998 ACM Subject Classification F.4.3 Formal Languages, F.4.1 Mathematical Logic
منابع مشابه
On Pebble Automata for Data Languages with Decidable Emptiness Problem
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-pebble automata is decidable, while the same problem for weak 3-pebble automata is undecidable. We also introduce the so-called top view weak PA. Roughly speaking, top view weak PA are weak PA where the equality test is ...
متن کاملOn Pebble Automata for Data Languages with Decidable Emptiness ProblemI,II
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-pebble automata is decidable, while the same problem for weak 3-pebble automata is undecidable. We also introduce the so-called top view weak PA. Roughly speaking, top view weak PA are weak PA where the equality test is ...
متن کاملOn the Regular Emptiness Problem of Subzero Automata
In the fundamental paper [5] Rabin proved that the monadic second order logic (MSO) of the full binary tree is decidable using the automata method. This proof technique can be roughly described as follows: (1) an appropriate notion of tree automaton is defined; (2) every formula φ of the MSO logic is effectively associated to an automaton Aφ such that that φ is true if and only if Aφ accepts a ...
متن کاملUpdatable timed automata
We investigate extensions of Alur and Dill’s timed automata, based on the possibility to update the clocks in a more elaborate way than simply reset them to zero. We call these automata updatable timed automata. They form an undecidable class of models, in the sense that emptiness checking is not decidable. However, using an extension of the region graph construction, we exhibit interesting dec...
متن کاملProbabilistic Automata on Finite Words: Decidable and Undecidable Problems
This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Emptiness Problem asks, given some probability 0 ≤ λ ≤ 1, whether there exists a word accepted with probability greater than λ, and the Isolation Problem asks whether there exist words whose acceptance probability is arbitrarily clos...
متن کامل