Search

• < Previous
• 1
• Next >

---

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

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&nbsp;[&hellip;]

---

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct

Shibashis Guha ; Ismaël Jecker ; Karoliina Lehtinen ; Martin Zimmermann.

We study the expressiveness and succinctness of history-deterministic pushdown automata (HD-PDA) over finite words, that is, pushdown automata whose nondeterminism can be resolved based on the run constructed so far, but independently of the remainder of the input word. These are also known as&nbsp;[&hellip;]

---