Good-for-games ω-Pushdown Automata

01/13/2020
by   Karoliina Lehtinen, et al.
0

We introduce good-for-games ω-pushdown automata (ω-GFG-PDA). These are automata whose nondeterminism can be resolved based on the run constructed thus far. Good-for-gameness enables automata to be composed with games, trees, and other automata, applications which otherwise require deterministic automata. Our main results show that ω-GFG-PDA are more expressive than deterministic ω-pushdown automata and that solving infinite games with winning conditions specified by ω-GFG-PDA is EXPTIME-complete, i.e., we have identified a new class of ω-contextfree winning conditions for which solving games is decidable. This means in particular that the universality problem is in EXPTIME as well. Moreover, we study closure properties of the class of languages recognized by ω-GFG-PDA and decidability of good-for-gameness of ω-pushdown automata and languages.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/06/2021

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct

We study the expressiveness and succinctness of good-for-games pushdown ...
03/07/2022

Weakness Makes Muller Delay Games Hard

We show that solving delay games with winning conditions given by determ...
06/12/2021

Minimization and Canonization of GFG Transition-Based Automata

While many applications of automata in formal methods can use nondetermi...
11/04/2021

Small model property reflects in games and automata

Small model property is an important property that implies decidability....
10/24/2017

Permutation Games for the Weakly Aconjunctive mu-Calculus

We introduce a natural notion of limit-deterministic parity automata and...
09/11/2018

Dynamic logic assigned to automata

A dynamic logic B can be assigned to every automaton A without regard ...
03/18/2022

Between SC and LOGDCFL: Families of Languages Accepted by Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata

The closure of deterministic context-free languages under logarithmic-sp...
This week in AI

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