Canonicity in GFG and Transition-Based Automata

  title={Canonicity in GFG and Transition-Based Automata},
  author={Bader Abu Radi and Orna Kupferman},
Minimization of deterministic automata on finite words results in a {\em canonical\/} automaton. For deterministic automata on infinite words, no canonical minimal automaton exists, and a language may have different minimal deterministic Buchi (DBW) or co-Buchi (DCW) automata. In recent years, researchers have studied {\em good-for-games\/} (GFG) automata -- nondeterministic automata that can resolve their nondeterministic choices in a way that only depends on the past. Several applications of… 
4 Citations

Figures from this paper

Minimization and Canonization of GFG Transition-Based Automata

Their minimization algorithm is based on a sequence of transformations the authors apply to the automaton, on top of which a minimal quotient automaton is defined, and all minimal automata have isomorphic safe components and once they saturate the automata with $\alpha$-transitions, they get full isomorphism.

Half-Positional Objectives Recognized by Deterministic Büchi Automata

This paper characterize objectives recognizable by deterministic Büchi automata (a class of ω -regular objectives) that are half-positional, in both finite and infinite graphs with natural conditions linked to the language-theoretic notion of right congruence.

On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions

It is deduced that finding the chromatic memory requirements of a Muller condition is NP -complete, and it is proved that chromatic memories cannot be optimal in general, disproving a conjecture by Kopczyński.

Technical Report Column

This report presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and therefore expensive and expensive process of manually cataloging and cataloging all the components of a smart phone.



Limit-Deterministic Büchi Automata for Linear Temporal Logic

This work presents a direct construction from an LTL formula \(\varphi \) to a limit-deterministic Buchi automaton, which yields much smaller automata for formulas with deep nesting of modal operators and performs at least as well as the existing approaches on general formulas.

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.

How Deterministic are Good-For-Games Automata?

GFG automata enjoy the benefits of typeness, similarly to the case of deterministic automata, and are shown to be exponentially more succinct than deterministic ones.

Büchi Good-for-Games Automata Are Efficiently Recognizable

Good-for-Games (GFG) automata offer a compromise between deterministic and nondetermin-istic automata. They can resolve nondeterministic choices in a step-by-step fashion, without needing any

Minimising Good-for-Games automata is NP complete

It is shown for the standard state based acceptance that the minimality of a GFG automaton is NP-complete for Buchi, Co-Buchi, and parity G FG automata, a surprisingly straight forward generalisation of the proofs from deterministic Buchi automata.

On Determinisation of Good-for-Games Automata

The main results of this work answer the question whether parity GFG automata actually present an improvement in terms of state-complexity the number of states compared to the deterministic ones.

Good-for-games ω-Pushdown Automata

These are automata whose nondeterminism can be resolved based on the run constructed thus far and it follows that the universality problem for ω-GFG-PDA is in EXPTIME as well.

Relating word and tree automata

This work relates the expressiveness gap between deterministic and nondeterministic Buchi word automata and the expressivity gap between Buchi and Rabin tree automata, and provides an exponential determinization of Buchi tree Automata that recognize derived languages.

Solving Games Without Determinization

The main insight is that a nondeterministic automaton is good for solving games if it fairly simulates the equivalent deterministicAutomata are constructed that omit the determinization step in game solving and reactive synthesis.

Nondeterminism in the Presence of a Diverse or Unknown Future

It is shown that GFT=GFG⊃DBP, and described a determinization construction for GFG automata, which shows the possible succinctness of GFG and GFT automata compared to deterministic automata.