Singleton Acceptance Conditions in !-automata
نویسندگان
چکیده
The regular !-languages can be deened by deterministic !-automata with the Rabin acceptance condition, referring to a list of pairs (Ek; Fk) 1km of state sets of the automaton: A successful run should visit some Ek only nitely often but the corresponding Fk innnitely often. If only the non-existence, respectively existence of such visits is required, precisely the Staiger-Wagner deenable !-languages are recognized. We study the question whether the sets Ek; Fk can be reduced to singletons, i.e. whether one can refer to individual states in place of state sets. It is shown that for the usual Rabin acceptance condition this causes no loss of expressive power, while for the Staiger-Wagner case the acceptance by singletons leads to a proper restriction.
منابع مشابه
On the Descriptional Complexity of Finite Automata With Modified Acceptance Conditions
We consider deterministic and nondeterministic finite automata with acceptance conditions that rely on the whole history of a computation on a given word and not only on the last state of the computation under consideration. Formally, these conditions can be seen as the natural analogies of the Büchi and Muller acceptance for finite automata on infinite words. We study the computational power o...
متن کاملQuantitative Fair Simulation Gamest
Simulation is an attractive alternative for language inclusion for automata as it is an under-approximation of language inclusion, but usually has much lower complexity. For non-deterministic automata, while language inclusion is PSPACE-complete, simulation can be computed in polynomial time. Simulation has also been extended in two orthogonal directions, namely, (1) fair simulation, for simula...
متن کاملWeak Muller Acceptance Conditions for Tree Automata
Over the last decades the theory of automata on infinite objects has been an important source of tools for the specification and the verification of computer programs. Trees are more suitable than words to model nondeterminism and concurrency. In the literature, there are several examples of acceptance conditions that have been proposed for automata on infinite words and then have been fruitful...
متن کاملComplexity of weak acceptance conditions in tree automata
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong conditions that are defined in terms of states appearing infinitely often on the run. Weak conditions appear in the context of model-checking and translations of logical formalisms to automata. We study the complexity o...
متن کاملOn-the-Fly Emptiness Checks for Generalized Büchi Automata
Emptiness check is a key operation in the automata-theoretic approach to LTL verification. However, it is usually done on Büchi automata with a single acceptance condition. We review existing on-the-fly emptiness-check algorithms for generalized Büchi automata (i.e., with multiple acceptance conditions) and show how they compete favorably with emptiness-checks for degeneralized automata, especi...
متن کامل