What is he best known for?
The fields of study he is best known for:
- Programming language
- Algorithm
- Discrete mathematics
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 most cited work include:
- Languages, automata, and logic (850 citations)
- Automata on infinite objects (752 citations)
- Automata on Infinite Objects. (442 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Discrete mathematics (50.29%)
- Decidability (26.29%)
- Automaton (25.71%)
What were the highlights of his more recent work (between 2009-2018)?
- Discrete mathematics (50.29%)
- Decidability (26.29%)
- Automaton (25.71%)
In recent papers he was focusing on the following fields of study:
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.
Between 2009 and 2018, his most popular works were:
- Einführung in die mathematische Logik (64 citations)
- Degrees of Lookahead in Regular Infinite Games (22 citations)
- Degrees of lookahead in regular infinite games (20 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algorithm
- Discrete mathematics
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.
