A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct

by   Shibashis Guha, et al.

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 DPDA, while PDA can be double-exponentially more succinct than GFG-PDA. We also study GFGness in visibly pushdown automata (VPA), which enjoy better closure properties than PDA, and for which we show GFGness to be EXPTIME-complete. GFG-VPA can be exponentially more succinct than deterministic VPA, while VPA can be exponentially more succinct than GFG-VPA. Both of these lower bounds are tight. Finally, we study the complexity of resolving nondeterminism in GFG-PDA. Every GFG-PDA has a positional resolver, a function that resolves nondeterminism and that is only dependant on the current configuration. Pushdown transducers are sufficient to implement the resolvers of GFG-VPA, but not those of GFG-PDA. GFG-PDA with finite-state resolvers are determinisable.



There are no comments yet.


page 1

page 2

page 3

page 4


Good-for-games ω-Pushdown Automata

We introduce good-for-games ω-pushdown automata (ω-GFG-PDA). These are a...

Lower bounds for the state complexity of probabilistic languages and the language of prime numbers

This paper studies the complexity of languages of finite words using aut...

On the Power of Unambiguity in Büchi Complementation

In this work, we exploit the power of unambiguity for the complementatio...

Decidability of cutpoint isolation for letter-monotonic probabilistic finite automata

We show the surprising result that the cutpoint isolation problem is dec...

VC-dimensions of nondeterministic finite automata for words of equal length

Ishigami and Tani studied VC-dimensions of deterministic finite automata...

Lecture Notes on Automata, Languages, and Grammars

These lecture notes are intended as a supplement to Moore and Mertens' T...

Sky Is Not the Limit: Tighter Rank Bounds for Elevator Automata in Büchi Automata Complementation (Technical Report)

We propose several heuristics for mitigating one of the main causes of c...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.