His main research concerns Discrete mathematics, Automata theory, Automaton, Decidability and Dynamic logic. His Discrete mathematics study combines topics in areas such as Büchi automaton, Mathematical logic and Combinatorics. His Büchi automaton research is multidisciplinary, incorporating elements of Nondeterministic algorithm, Undecidable problem and Binary tree.
Wolfgang Thomas interconnects Basis, Algebra and Programming language in the investigation of issues within Automata theory. His work deals with themes such as Reactive system and Development, which intersect with Automaton. His research investigates the connection between Dynamic logic and topics such as Philosophy of logic that intersect with issues in Accessibility relation, Multimodal logic, Computational logic, Modal μ-calculus and Description logic.
His primary areas of investigation include Discrete mathematics, Decidability, Automaton, Combinatorics and Theoretical computer science. His research integrates issues of Finite-state machine, Regular language, Tree automaton and Automata theory in his study of Discrete mathematics. When carried out as part of a general Automata theory research project, his work on Nested word, Quantum finite automata and ω-automaton is frequently linked to work in Executive summary, therefore connecting diverse disciplines of study.
His biological study spans a wide range of topics, including Natural number, Binary tree, Reachability and Finite set. His Automaton research integrates issues from Algorithm, Programming language, Bounded function and Development. His study in Combinatorics is interdisciplinary in nature, drawing from both Simple and Pushdown automaton.
His scientific interests lie mostly in Discrete mathematics, Decidability, Automaton, Theoretical computer science and Automata theory. His Discrete mathematics study incorporates themes from Finite set, Class, Regular language, Binary tree and Alternation. His Decidability research incorporates elements of Natural number, Combinatorics, Tree structure, Successor cardinal and Finite-state machine.
Wolfgang Thomas has researched Automaton in several fields, including Model checking, World Wide Web and Expressive power. His studies in Theoretical computer science integrate themes in fields like Reactive system, Data structure and Turing machine. His study looks at the relationship between Automata theory and topics such as Algebra, which overlap with Infinite game, ω-automaton and Nested word.
Wolfgang Thomas mainly focuses on Decidability, Discrete mathematics, Automaton, Reachability and Alternation. The various areas that he examines in his Decidability study include Chain, Path, Tree and Structure. The study incorporates disciplines such as Algorithm and Alternation in addition to Discrete mathematics.
His Automaton study integrates concerns from other disciplines, such as Finite-state machine and Closure. His Reachability research includes themes of Programming language, Rewriting and Word. His Alternation research incorporates themes from Finite set, Bounded function, Exponential function and Combinatorics.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Heinz-Dieter Ebbinghaus;Wolfgang Thomas.
Languages, automata, and logic
Handbook of formal languages, vol. 3 (1997)
Automata on infinite objects
Handbook of theoretical computer science (vol. B) (1991)
Automata logics, and infinite games: a guide to current research
Erich Grädel;Wolfgang Thomas;Thomas Wilke.
Automata Logics, and Infinite Games
Erich Grädel;Wolfgang Thomas;Thomas Wilke.
On the synthesis of strategies in infinite games
symposium on theoretical aspects of computer science (1995)
Classifying regular events in symbolic logic
Journal of Computer and System Sciences (1982)
Einführung in die mathematische Logik
Heinz-Dieter Ebbinghaus;Jörg Flum;Wolfgang Thomas.
Computation tree logic CTL * and path quantifiers in the monadic theory of the binary tree
Thilo Hafer;Wolfgang Thomas.
international colloquium on automata, languages and programming (1987)
Infinite Games and Verification
computer aided verification (2002)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: