The following pages link to Wolfgang Thomas (Q391109):
Displaying 50 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)
- Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (Q3451103) (← links)
- Optimal strategy synthesis for request-response games (Q3465629) (← links)
- Model Transformations in Decidability Proofs for Monadic Theories (Q3540168) (← links)
- Degrees of Lookahead in Regular Infinite Games (Q3557856) (← links)
- Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications (Q3559788) (← links)
- On Monadic Theories of Monadic Predicates (Q3586024) (← links)
- On Intersection Problems for Polynomially Generated Sets (Q3591425) (← links)
- Logical Refinements of Church’s Problem (Q3608405) (← links)
- Decidable Theories of the Ordering of Natural Numbers with Unary Predicates (Q3613363) (← links)
- Facets of Synthesis: Revisiting Church’s Problem (Q3617717) (← links)
- COMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS (Q3646170) (← links)
- (Q3768883) (← links)
- On frontiers of regular trees (Q3780462) (← links)
- (Q3785956) (← links)
- (Q3806849) (← links)
- On the bounded monadic theory of well-ordered structures (Q3877655) (← links)
- (Q3887597) (← links)
- A combinatorial approach to the theory of ω-automata (Q3934375) (← links)
- (Q3967525) (← links)
- (Q4023926) (← links)
- (Q4029611) (← links)
- (Q4036584) (← links)
- A note on undecidable extensions of monadic second order successor arithmetic (Q4088806) (← links)
- (Q4182465) (← links)
- Star-free regular sets of ω-sequences (Q4198738) (← links)
