Good-for-games $\omega$-Pushdown Automata

We introduce good-for-games $\omega$-pushdown automata ($\omega$-GFG-PDA). These are automata whose nondeterminism can be resolved based on the input processed so far. Good-for-gameness enables automata to be composed with games, trees, and other automata, applications which otherwise require determ...

Full description

Saved in:

Bibliographic Details
Published in:	Logical methods in computer science Vol. 18, Issue 1
Main Authors:	Lehtinen, Karoliina, Zimmermann, Martin
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science Association 15.02.2023 Logical Methods in Computer Science e.V
Subjects:	68q45 Computer Science computer science - computer science and game theory computer science - formal languages and automata theory f.4.3
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!