A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct

@inproceedings{Guha2021ABO,
title={A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct},
author={Shibashis Guha and Isma{\"e}l Jecker and Karoliina Lehtinen and Martin Zimmermann},
booktitle={MFCS},
year={2021}
}
• Published in MFCS 6 May 2021
• Computer Science
We study the expressiveness and succinctness of good-for-games pushdown automata (GFG-PDA) over finite words, that is, pushdown automata whose nondeterminism can be resolved based on the run constructed so far, but independently of the remainder of the input word. We prove that GFG-PDA recognise more languages than deterministic PDA (DPDA) but not all context-free languages (CFL). This class is orthogonal to unambiguous CFL. We further show that GFG-PDA can be exponentially more succinct than…
4 Citations

Figures from this paper

On the size of good-for-games Rabin automata and its link with the memory in Muller games
• Computer Science
ArXiv
• 2022
It is established that good-for-games Rabin automata that recognise a Muller language are exactly of the same size as the minimal memory required for winning Muller games that have this language as their winning condition, thus proving as a consequence that chromatic memory for winning a Muller game can be exponentially larger than unconstrained memory.
Token Games and History-Deterministic Quantitative-Automata
• Computer Science
FoSSaCS
• 2022
A nondeterministic automaton is history-deterministic if its nondeterminism can be resolved by only considering the prefix of the word read so far. Due to their good compositional properties,
Good-for-games ω-Pushdown Automata
• Computer Science
Log. Methods Comput. Sci.
• 2022
These are automata whose nondeterminism can be resolved based on the input processed so far and it is shown that solving infinite games with winning conditions specified by $\omega$-GFG-PDA is EXPTIME-complete and that the universality problem for the automata is in EXPTime as well.
History Determinism vs. Good for Gameness in Quantitative Automata
• Computer Science
FSTTCS
• 2021
It is shown that good-for-games automata are central for “global” (classical) synthesis, while “local’ (good-enough) synthesis reduces to deciding whether a nondeterministic automaton is history deterministic.

References

SHOWING 1-10 OF 45 REFERENCES
Good-Enough Synthesis
• Materials Science
CAV
• 2020
This work introduces and studies good-enough synthesis (ge-synthesis) – a variant of synthesis in which the system is required to satisfy a given specification that is particularly relevant when the notion of correctness is multi-valued (rather than Boolean).
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.
Uniformization in Automata Theory
• Computer Science, Mathematics
• 2013
It is shown that it is undecidable whether a given rational relation can be uniformized by a subsequential transducer and a decision procedure is provided for the case of automatic relations.
Good-for-games ω-Pushdown Automata
• Computer Science
LICS
• 2020
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.
Büchi Good-for-Games Automata Are Efficiently Recognizable
• Computer Science
FSTTCS
• 2018
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
Computing the Width of Non-deterministic Automata
• Computer Science
Log. Methods Comput. Sci.
• 2019
It is shown that computing the width of an automaton is EXPTime-complete, which implies EXPTIME-completeness for multipebble simulation games on NFAs, and shows that checking whether a coB\"uchi automata is determinisable by pruning is NP-complete.
Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata
• Computer Science
RP
• 2010
This paper summarizes and discusses developments relevant to (un)ambiguous finite automata and pushdown automata problems from the descriptional complexity point of view and draws attention to the big picture and some of the main ideas involved.