40 citations · 92 across the 18 of their papers we have counts for
3 papers · 1 filter
On the Succinctness of Alternating Parity Good-for-Games Automata
Udi Boker, Denis Kuperberg, Karoliina Lehtinen +1
We study alternating parity good-for-games (GFG) automata, i.e., alternating parity automata where both conjunctive and disjunctive choices can be resolved in an online manner, wit…
On Succinctness and Recognisability of Alternating Good-for-Games Automata
Udi Boker, Denis Kuperberg, Karoliina Lehtinen +1
We study alternating good-for-games (GFG) automata, i.e., alternating automata where both conjunctive and disjunctive choices can be resolved in an online manner, without knowledge…
Good-for-games -Pushdown Automata
Karoliina Lehtinen, Martin Zimmermann
We introduce good-for-games -pushdown automata (-GFG-PDA). These are automata whose nondeterminism can be resolved based on the input processed so far. Good-for-gameness enab…