Wolfgang Thomas
#139,865
Most Influential Person Now
Researcher, member of Academia Europaea
Wolfgang Thomas's AcademicInfluence.com Rankings
Wolfgang Thomascomputer-science Degrees
Computer Science
#6641
World Rank
#7000
Historical Rank
Theoretical Computer Science
#94
World Rank
#94
Historical Rank
Database
#3723
World Rank
#3876
Historical Rank
Download Badge
Computer Science
Wolfgang Thomas's Degrees
- PhD Computer Science University of Stuttgart
Similar Degrees You Can Earn
Why Is Wolfgang Thomas Influential?
(Suggest an Edit or Addition)Wolfgang Thomas's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Automata on Infinite Objects (1991) (1532)
- Languages, Automata, and Logic (1997) (1058)
- Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics (1990) (797)
- Automata logics, and infinite games: a guide to current research (2002) (686)
- Automata Logics, and Infinite Games (2002) (462)
- On the Synthesis of Strategies in Infinite Games (1995) (429)
- Classifying Regular Events in Symbolic Logic (1982) (320)
- Mathematical logic (1985) (256)
- Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree (1987) (175)
- Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems (1996) (107)
- Logical Specifications of Infinite Computations (1993) (102)
- Logical Aspects in the Study of Tree Languages (1984) (97)
- Infinite Games and Verification (Extended Abstract of a Tutorial) (2002) (95)
- On Logics, Tilings, and Automata (1991) (89)
- Alternating Automata and Logics over Infinite Words (2000) (78)
- regular Languages Defined with Generalized Quantifiers (1988) (73)
- On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science (1993) (72)
- Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words (1997) (69)
- A Combinatorial Approach to the Theory of omega-Automata (1981) (68)
- The Monadic Theory of Morphic Infinite Words and Generalizations (2000) (67)
- Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications (2003) (63)
- Star-Free Regular Sets of omega-Sequences (1979) (61)
- A Short Introduction to Infinite Automata (2001) (60)
- Degrees of Lookahead in Regular Infinite Games (2010) (55)
- Computation and Proof Theory (1984) (52)
- An application of the Ehrenfeucht-Fraisse game in formal language theory (1984) (51)
- Deterministic Automata on Unranked Trees (2005) (51)
- Constructing Infinite Graphs with a Decidable MSO-Theory (2003) (50)
- Church's Problem and a Tour through Automata Theory (2008) (48)
- The monadic quantifier alternation hierarchy over graphs is infinite (1997) (48)
- Facets of Synthesis: Revisiting Church's Problem (2009) (47)
- Observations on determinization of Büchi automata (2005) (45)
- Complementation of Büchi Automata Revised (1999) (41)
- On Frontiers of Regular Trees (1986) (41)
- Regular Tree Languages Without Unary Symbols are Star-Free (1993) (41)
- Star-Free Regular Sets of ~o-Sequences (2004) (41)
- Automata Theory on Trees and Partial Orders (1997) (39)
- Infinite Trees and Automation-Definable Relations over omega-Words (1992) (38)
- The Monadic Quantifier Alternation Hierarchy over Grids and Graphs (2002) (37)
- Model checking synchronized products of infinite transition systems (2004) (37)
- Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies (2009) (34)
- Regular Languages Defined with Generalized Quanifiers (1995) (34)
- NONDETERMINISM VERSUS DETERMINISM OF FINITE AUTOMATA OVER DIRECTED ACYCLIC GRAPHS (1994) (34)
- Elements of an automata theory over partial orders (1997) (33)
- Computation tree logic and regular omega-languages (1988) (32)
- Solving Pushdown Games with a Sigma3 Winning Condition (2002) (32)
- Report on the Program AMoRE (1994) (31)
- Decidable Theories of the Ordering of Natural Numbers with Unary Predicates (2006) (30)
- On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees (1987) (28)
- A Concatenation Game and the Dot-Depth Hierarchy (1987) (26)
- The theory of successor with an extra predicate (1978) (24)
- A note on undecidable extensions of monadic second order successor arithmetic (1975) (24)
- Methods for the Transformation of ω-Automata : Complexity and Connection to Second Order Logic (1998) (24)
- A Game Theoretic Approach to the Analysis of Dynamic Networks (2008) (22)
- Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems (1994) (21)
- Solution of Church ’ s Problem : A Tutorial (2007) (21)
- A hierarchy of sets of infinite trees (1983) (19)
- AMORE: A System for Computing Automata, MOnoids, and Regular Expressions (1989) (19)
- Optimal Strategy Synthesis in Request-Response Games (2008) (19)
- Logical Refinements of Church's Problem (2007) (17)
- Mathematical logic (2. ed.) (1994) (17)
- Infinite Trees and Automaton Definable Relations over Omega-Words (1990) (17)
- Tiling Systems over Infinite Pictures and Their Acceptance Conditions (2002) (16)
- Optimal strategy synthesis for request-response games (2014) (16)
- Automata and quantifier hierarchies (1987) (14)
- Safety- and liveness-properties in propositional temporal logic: characterizations and decidability (1988) (13)
- On the bounded monadic theory of well-ordered structures (1980) (13)
- Tree Languages Recognizable by Regular Frontier Check (1993) (13)
- Logic for Computer Science: The Engineering Challenge (2001) (11)
- Infinite graphs generated by tree rewriting (2003) (11)
- Trees and Term Rewriting in 1910 : On a Paperby Axel Thue (2007) (11)
- Decision problems over infinite graphs : higher order pushdown systems and synchronized products (2005) (10)
- Remark on the Star-Height-Problem (1981) (9)
- Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (2015) (8)
- Automata Theory and Infinite Transition Systems ∗ (2006) (8)
- Finite-State Strategies in Regular Infinite Games (1994) (8)
- Moving in a network under random failures: A complexity analysis (2012) (8)
- ,,When nobody else dreamed of these things“ – Axel Thue und die Termersetzung (2010) (8)
- Trees over Infinite Structures and Path Logics with Synchronization (2011) (7)
- Handbook of Formal Languages (2013) (7)
- Uniform and nonuniform recognizability (2003) (7)
- Connectivity games over dynamic networks (2011) (7)
- The Complexity of Reachability in Randomized Sabotage Games (2009) (6)
- The Reachability Problem over Infinite Graphs (2009) (6)
- 05241 Executive Summary - Synthesis and Planning (2005) (6)
- Compositionality and Reachability with Conditions on Path Lengths (2009) (5)
- Complementation of B Uchi Automata Revisited (1999) (5)
- On Intersection Problems for Polynomially Generated Sets (2006) (5)
- Relativized star-free expressions, first-order logic, and a concatenation game (1988) (5)
- Foundations of Software Science and Computation Structures (2003) (5)
- Languages vs. ω-Languages in Regular Infinite Games (2011) (5)
- Path Logics with Synchronization (2009) (5)
- Languages versus ω-Languages in Regular Infinite Games (2012) (4)
- Playing Games in the Baire Space (2016) (4)
- Counter-Free Automata, First-Order Logic and Star-Free Expressions (1995) (4)
- Synthesis of behavioral controllers for Discrete Event Systems with NCES-like Petri net models (2009) (4)
- Finite Automata and the Analysis of Infinite Transition Systems (2012) (4)
- Finite-State Recognizability and Logic: from Words to Graphs (1994) (3)
- Alternating Automata and Logics over Innite Words (Extended Abstract) (2000) (3)
- Model Transformations in Decidability Proofs for Monadic Theories (2008) (3)
- Some Perspectives of Infinite-State Verification (2005) (3)
- Compositional Failure Detection in Structured Transition Systems (2011) (3)
- Synthesis of behavioral controllers for DES: Increasing efficiency (2010) (3)
- Infinite trees and automaton definable over Ω-words (1990) (3)
- Algorithms: From Al-Khwarizmi to Turing and Beyond (2015) (2)
- STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings (2007) (2)
- N-Memory Automata over the Alphabet N (2017) (2)
- A Game-Theoretic Approach to Routing under Adversarial Conditions (2010) (2)
- Semantics of First-Order Languages (2021) (2)
- On Monadic Theories of Monadic Predicates (2010) (2)
- STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings (2006) (2)
- Infinite Games and Uniformization (2011) (2)
- Monadic logic and automata: recent developments (1998) (1)
- European Summer Meeting of the Association for Symbolic Logic (1985) (1)
- Parametrized Infinite Games and Higher-Order Pushdown Strategies (2009) (1)
- An Algebraic Characterization of Elementary Equivalence (2021) (1)
- Logics for Regular Languages, Finite Monoids, and Circuit Complexity (1995) (1)
- Uniformization of Automaton Definable Tree Relations (2014) (1)
- Computer science logic : 11th international workshop, CSL '97 : annual conference of the EACSL, Aarhus, Denmark, August 23-29, 1997 : selected papers (1998) (1)
- A PRESENTATION AND TUTORING ENVIRONMENT FOR COURSES IN THEORETICAL COMPUTER SCIENCE (2003) (1)
- E-Learning in Theoretical Computer Science : Experiences From an Undergraduate Course (2003) (1)
- Synthesis and Planning (2006) (0)
- Singleton Acceptance Conditions in !-automata (1998) (0)
- Qualitative Concurrent Stochastic Games with Imperfect Information ⋆ (2019) (0)
- Composition Over the Natural Number Ordering with an Extra Binary Relation (2015) (0)
- Report from Dagstuhl Seminar 15061 Non-Zero-Sum-Games and Control (2015) (0)
- Determinacy of Infinite Games: Perspectives of the Algorithmic Approach (Invited Talk) (2017) (0)
- Topological Complexity of omega-Powers : Extended (2021) (0)
- Syntactic Interpretations and Normal Forms (2021) (0)
- Foundations of software science and computation structures : Second International Conference, FOSSACS '99 held as part of the joint European Conferences on Theory and Practice of Software, ETAPS '99, Amsterdam, The Netherlands, March 22-28, 1999 : proceedings (1999) (0)
- OBERHAUSEN ”CENTER” — MARKETSTREET UNDER ONE ROOF (2001) (0)
- Ehrenfeucht, Vaught, and the decidability of the weak monadic theory of successor (2018) (0)
- Synthesis and Some of Its Challenges (2012) (0)
- Limitations of the Formal Method (1994) (0)
- Syntax of First-Order Languages (2021) (0)
- STACS 2007: 24th Annual Symposium on Theoretical Aspects of Computer ScienceAachen, Germany, February 22-24, 2007Proceedings (Lecture Notes in Computer Science) (2007) (0)
- 10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees (2010) (0)
- The Löwenheim-Skolem Theorem and the Compactness Theorem (1994) (0)
- Infinite Games: Tema con Due Variazioni: Invited Presentation at the First Symposium on Games, Automata, Logic, and Formal Verification (2010) (0)
- Collection Topological and Game-Theoretic Aspects of In nite Computations Dagstuhl Seminar (2008) (0)
- 08271 Executive Summary - Topological and Game-Theoretic Aspects of Infinite Computations (2008) (0)
- Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II (2009) (0)
- Solving Infinite Games in the Baire Space (2021) (0)
- Model-checking des MSO-formules sur des structures infinies (2008) (0)
- Collection Advances and Applications of Automata on Words and Trees — Dagstuhl Seminar — (2011) (0)
- A Sequent Calculus (2021) (0)
- Advances and applications of automata on words and trees : abstracts collection (2011) (0)
- Free Models and Logic Programming (2021) (0)
- Non-Zero-Sum-Games and Control (Dagstuhl Seminar 15061) (2015) (0)
- Advances and applications of automata on words and trees : executive summary (2011) (0)
- 05241 Abstracts Collection - Synthesis and Planning (2005) (0)
- Optimizing Winning Strategies in Regular Infinite Games (2008) (0)
- 2 Synthesis of Succinct Representations of Strategies (0)
- Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99 (1999) (0)
- Automata, languages and programming : 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009 : proceedings (2009) (0)
- Sorting and Selection with Imprecise Comparisons (2012) (0)
- The Engineering Challenge for Logic (2001) (0)
- Preface of STACS 2007 Special Issue (2010) (0)
- Selected Papers from the11th International Workshop on Computer Science Logic (1997) (0)
- Synthesis and Planning, 12.-17. June 2005 (2006) (0)
- Extensions of First-Order Logic (2021) (0)
- Turing's Vision: The Birth of Computer Science (2018) (0)
- 08271 Abstracts Collection - Topological and Game-Theoretic Aspects of Infinite Computations (2008) (0)
- The Scope of First-Order Logic (2021) (0)
- Finite-Delay Strategies In Infinite Games (2011) (0)
- 10501 Executive Summary - Advances and Applications of Automata on Words and Trees (2010) (0)
- The Completeness Theorem (2021) (0)
- Author: Saeed Salehi (Saeed @ Math.Net) Title: Varieties of Tree Languages (2005) (0)
- What are "Good" Winning Strategies in Infinite Games?: Invited Presentation at the 2nd International Workshop on Strategic Reasoning (2014) (0)
This paper list is powered by the following services:
Other Resources About Wolfgang Thomas
What Schools Are Affiliated With Wolfgang Thomas?
Wolfgang Thomas is affiliated with the following schools:
