27 citations · 46 across the 9 of their papers we have counts for
9 papers
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…
Solving Infinite Games in the Baire Space
Benedikt Brütsch, Wolfgang Thomas
Infinite games (in the form of Gale-Stewart games) are studied where a play is a sequence of natural numbers chosen by two players in alternation, the winning condition being a sub…
Playing Games in the Baire Space
Benedikt Brütsch, Wolfgang Thomas
We solve a generalized version of Church's Synthesis Problem where a play is given by a sequence of natural numbers rather than a sequence of bits; so a play is an element of the B…
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…
Trees over Infinite Structures and Path Logics with Synchronization
Alex Spelten, Wolfgang Thomas, Sarah Winter
We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinit…