Determinising Parity Automata

  title={Determinising Parity Automata},
  author={Sven Schewe and Thomas Varghese},
Parity word automata and their determinisation play an important role in automata and game theory. We discuss a determinisation procedure for nondeterministic parity automata through deterministic Rabin to deterministic parity automata. We prove that the intermediate determinisation to Rabin automata is optimal. We show that the resulting determinisation to parity automata is optimal up to a small constant. Moreover, the lower bound refers to the more liberal Streett acceptance. We thus show… 

Tight Bounds for Complementing Parity Automata

A complementation procedure is established from transition labelled parity automata to transition labelled nondeterministic Buchi automata and it is proved to be tight up to an O(n) factor, where n is the size of the nondetergetic parity automaton.

Approximate Automata for Omega-Regular Languages

This work states that some applications, such as synthesis and probabilistic model checking, require that properties are represented as some type of deterministic \(\omega \)-automata, but properties cannot always be represented by automata with the desired acceptance condition and determinism.

Parity and generalised Büchi automata : determinisation and complementation

A tight determinisation procedure for Buchi automata, which uses a simplification of Safra trees called history trees, and suitable data structures for the complementation procedures based on the data structure used for determinisation.

Optimal transformations of Muller conditions

The alternating cycle decomposition transformation is introduced, and a strong optimality result is proved: for any given deterministic Muller automaton, the obtained parity automaton is minimal both in size and number of priorities among those automata admitting a morphism into the original Muller Automaton.

Deterministic and game separability for regular languages of infinite trees

It is decidable whether two regular languages of infinite trees are separable by a deterministic language, resp.

Optimal Transformations of Games and Automata Using Muller Conditions

A new transformation is defined called the alternating cycle decomposition, inspired and extending Zielonka’s construction, which operates on transition systems, encompassing both automata and games, and preserves semantic properties through the existence of a locally bijective morphism.

Permutation Games for the Weakly Aconjunctive mu-Calculus

By showing that limit-deterministic parity automata can be used to recognize unsuccessful branches in pre-tableaux for the weakly aconjunctive $\mu$-calculus, satisfiability games of size $n$ with $\mathcal{O}(nk)$ priorities with alternation-depth $k$ are obtained.

A Survey on Satisfiability Checking for the μ-Calculus through Tree Automata

This work views the non-emptiness checking of alternating tree automata by a reduction to solving parity games of a certain structure, so-called emptiness games, and shows how the construction of the emptiness games combines a (fixed) structural part with (history-)determinization of parity word automata.

On the (In)Succinctness of Muller Automata

There is inconsistency and incompleteness in the literature results regarding the translations to and from Muller automata, and the Muller type can be considered less succinct than parity, Rabin, and Streett automata.

L O ] 2 4 O ct 2 01 7 Permutation Games for the Weakly Aconjunctive μ-Calculus

We introduce a natural notion of limit-deterministic parity automata and present a method that uses such automata to construct satisfiability games for the weakly aconjunctive fragment of the



Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata

It is shown how the optimal determinisation technique can be used as a foundation for complementation and established that the resulting complementation is tight.

Progress measures, immediate determinacy, and a subset construction for tree automata

  • Nils Klarlund
  • Mathematics
    [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science
  • 1992
Using the concept of a progress measure, a simplified proof is given of M.O. Rabin's (1969) fundamental result that the languages defined by tree automata are closed under complementation and a graph-theoretic duality theorem for such acceptance conditions is shown.

Tighter Bounds for the Determinisation of Büchi Automata

This paper proposes a determinisation technique that is simpler than the constructions of Safra, Piterman, and Muller and Schupp, because it separates the principle acceptance mechanism from the concrete acceptance condition.

On the complexity of omega -automata

  • S. Safra
  • Computer Science
    [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
The author presents a determinisation construction that is simpler and yields a single exponent upper bound for the general case, and can be used to obtain an improved complementation construction for Buchi automata that is essentially optimal.

Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique

  • Qiqi Yan
  • Computer Science
    Log. Methods Comput. Sci.
  • 2006
A new lower bound technique for the state complexity of transformations of automata is introduced and an Ω((0.76n)n) lower bound for Buchi complementation is proved, which also holds for almost every complementation and determinization transformation of nondeterministic ω-automata.

The Büchi Complementation Saga

Progress is reviewed on the complementation problem for nondeterministic word automata, which dates back to its introduction in Buchi's seminal 1962 paper, as the subset construction is not sufficient.

A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata

A lower bound hist(n) is established for the problem of translating a Buchi word automaton of size n into a deterministic Rabin word Automaton when both the Buchi and the Rabin condition label transitions rather than states.

Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete

The NP-completeness of the problem of minimising deterministic automata over finite and infinite words is established, and the introduction of almost equivalence is introduced, an equivalence class for strictly between language equivalence for deterministic \buchi\ or \cobuchi\ automata and language equivalenced automata.

Safraless decision procedures

This paper translations are significantly simpler than the standard approach, less difficult to implement, and have practical advantages like being amenable to optimizations and a symbolic implementation, and it is shown that the approach yields better complexity bounds.

Exponential determinization for ω-automata with strong-fairness acceptance condition (extended abstract)

The results imply that Streett automata can be used instead of Bu¨chi automata (with the weaker acceptance condition) without any loss of efficiency, and show an exponential determinization construction for any Streett Automaton.