DeepAI AI Chat
Log In Sign Up

Good-for-games ω-Pushdown Automata

by   Karoliina Lehtinen, et al.

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.


page 1

page 2

page 3

page 4


A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct

We study the expressiveness and succinctness of good-for-games pushdown ...

Weakness Makes Muller Delay Games Hard

We show that solving delay games with winning conditions given by determ...

Small model property reflects in games and automata

Small model property is an important property that implies decidability....

Discounted-Sum Automata with Multiple Discount Factors

Discounting the influence of future events is a key paradigm in economic...

Dynamic logic assigned to automata

A dynamic logic B can be assigned to every automaton A without regard ...

A Hierarchy of Nondeterminism

We study three levels in a hierarchy of nondeterminism: A nondeterminist...

Natural Colors of Infinite Words

While finite automata have minimal DFAs as a simple and natural normal f...