2 results
Karoliina Lehtinen ; Martin Zimmermann.
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 […]
Published on February 15, 2023
Karoliina Lehtinen ; Paweł Parys ; Sven Schewe ; Dominik Wojtczak.
Zielonka's classic recursive algorithm for solving parity games is perhaps the simplest among the many existing parity game algorithms. However, its complexity is exponential, while currently the state-of-the-art algorithms have quasipolynomial complexity. Here, we present a modification of […]
Published on January 12, 2022