27 citations · 69 across the 15 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.FL2019
Good for Games Automata: From Nondeterminism to Alternation
Udi Boker, Karoliina Lehtinen
A word automaton recognizing a language is good for games (GFG) if its composition with any game with winning condition preserves the game's winner. While all deterministic…
cs.FL2019★ 3 cited
Register Games
Karoliina Lehtinen, Udi Boker
The complexity of parity games is a long standing open problem that saw a major breakthrough in 2017 when two quasi-polynomial algorithms were published. This article presents a th…