27 citations · 46 across the 9 of their papers we have counts for
3 papers · 1 filter
On the Boolean Closure of Deterministic Top-Down Tree Automata
Christof Löding, Wolfgang Thomas
The class of Boolean combinations of tree languages recognized by deterministic top-down tree automata (also known as deterministic root-to-frontier automata) is studied. The probl…
Optimal Strategy Synthesis for Request-Response Games
Florian Horn, Wolfgang Thomas, Nico Wallmeier +1
We show the existence and effective computability of optimal winning strategies for request-response games in case the quality of a play is measured by the limit superior of the me…
Degrees of Lookahead in Regular Infinite Games
Michael Holtmann, Lukasz Kaiser, Wolfgang Thomas
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a f…