The following pages link to Wolfgang Thomas (Q391109):
Displaying 27 items.
- Connectivity games over dynamic networks (Q391110) (← links)
- Observations on determinization of Büchi automata (Q860867) (← links)
- Remark on the star-height-problem (Q1149251) (← links)
- Classifying regular events in symbolic logic (Q1173413) (← links)
- Infinite trees and automaton-definable relations over \(\omega\)-words (Q1199531) (← links)
- The theory of successor with an extra predicate (Q1243711) (← links)
- Nondeterminism versus determinism of finite automata over directed acyclic graphs (Q1326955) (← links)
- Uniform and nonuniform recognizability. (Q1853746) (← links)
- The monadic theory of morphic infinite words and generalizations (Q1854542) (← links)
- Regular languages defined with generalized quantifiers (Q1892890) (← links)
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems (Q1917078) (← links)
- Automata on finite trees (Q2074209) (← links)
- The monadic quantifier alternation hierarchy over grids and graphs (Q2506497) (← links)
- A Game Theoretic Approach to the Analysis of Dynamic Networks (Q2864354) (← links)
- Composition Over the Natural Number Ordering with an Extra Binary Relation (Q2947182) (← links)
- Infinite Games and Uniformization (Q3063966) (← links)
- (Q3123635) (← links)
- A Game-Theoretic Approach to Routing under Adversarial Conditions (Q3163897) (← links)
- Degrees of Lookahead in Regular Infinite Games (Q3166215) (← links)
- Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies (Q3183608) (← links)
- (Q3220545) (← links)
- (Q3221429) (← links)
- An application of the Ehrenfeucht-Fraisse game in formal language theory (Q3347321) (← links)
- (Q3356287) (← links)
- The Reachability Problem over Infinite Graphs (Q3392937) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431297) (← links)
- On the Boolean Closure of Deterministic Top-Down Tree Automata (Q6154972) (← links)
