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...

Celý popis

Podrobná bibliografia

Vydané v:	Logical methods in computer science Ročník 18, Issue 1
Hlavní autori:	Lehtinen, Karoliina, Zimmermann, Martin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Logical Methods in Computer Science Association 15.02.2023 Logical Methods in Computer Science e.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!