default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWolfgang Thomas
Person information
- affiliation: RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j37]Christof Löding, Wolfgang Thomas:
On the Boolean Closure of Deterministic Top-Down Tree Automata. Int. J. Found. Comput. Sci. 35(1&2): 11-22 (2024)- [i13]Christof Löding, Wolfgang Thomas:
On the Boolean Closure of Deterministic Top-Down Tree Automata. CoRR abs/2401.06596 (2024) - 2022
- [j36]Benedikt Brütsch, Wolfgang Thomas:
Solving Infinite Games in the Baire Space. Fundam. Informaticae 186(1-4): 63-88 (2022) - [e12]Helen Bolke-Hermanns, Joost-Pieter Katoen, Klaus Indermark, Stefan Kowalewski, Thomas Noll, Wolfgang Thomas:
50 Jahre Studiengang Informatik an der RWTH. RWTH Aachen, Fachgruppe Informatik in der Fakultät für Mathematik, Informatik und Naturwissenschaften, Germany 2022 - 2021
- [p5]Christof Löding, Wolfgang Thomas:
Automata on finite trees. Handbook of Automata Theory (I.) 2021: 235-264 - [i12]Benedikt Brütsch, Wolfgang Thomas:
Solving Infinite Games in the Baire Space. CoRR abs/2111.10881 (2021)
2010 – 2019
- 2018
- [j35]Christopher Czyba, Wolfgang Thomas, Christopher Spinrath:
Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change. Int. J. Found. Comput. Sci. 29(2): 213-232 (2018) - [j34]Wolfgang Thomas:
Ehrenfeucht, Vaught, and the decidability of the weak monadic theory of successor. ACM SIGLOG News 5(1): 14-18 (2018) - 2017
- [c74]Wolfgang Thomas:
Determinacy of Infinite Games: Perspectives of the Algorithmic Approach (Invited Talk). CSL 2017: 6:1-6:1 - [c73]Benedikt Brütsch, Patrick Landwehr, Wolfgang Thomas:
N-Memory Automata over the Alphabet N. LATA 2017: 91-102 - 2016
- [j33]Luca Aceto, Thomas A. Henzinger, Joost-Pieter Katoen, Wolfgang Thomas, Moshe Y. Vardi:
Viewpoints on "Logic activities in Europe", twenty years later. Bull. EATCS 118 (2016) - [j32]Luca Aceto, Mariangiola Dezani-Ciancaglini, Yuri Gurevich, David Harel, Monika Henzinger, Giuseppe F. Italiano, Scott A. Smolka, Paul G. Spirakis, Wolfgang Thomas:
EATCS Fellows' Advice to the Young Theoretical Computer Scientist. Bull. EATCS 119 (2016) - [c72]Benedikt Brütsch, Wolfgang Thomas:
Playing Games in the Baire Space. Cassting/SynCoP 2016: 13-25 - [i11]Marc Herbstritt, Wolfgang Thomas:
LIPIcs - an Open-Access Series for International Conference Proceedings. ERCIM News(107) (2016) - 2015
- [j31]Florian Horn, Wolfgang Thomas, Nico Wallmeier, Martin Zimmermann
:
Optimal strategy synthesis for request-response games. RAIRO Theor. Informatics Appl. 49(3): 179-203 (2015) - [c71]Wolfgang Thomas:
Composition Over the Natural Number Ordering with an Extra Binary Relation. Fields of Logic and Computation II 2015: 297-306 - [c70]Christopher Czyba, Christopher Spinrath, Wolfgang Thomas:
Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change. DLT 2015: 203-214 - [i10]Krishnendu Chatterjee, Stéphane Lafortune, Nicolas Markey, Wolfgang Thomas:
Non-Zero-Sum-Games and Control (Dagstuhl Seminar 15061). Dagstuhl Reports 5(2): 1-25 (2015) - 2014
- [j30]John Corcoran, Paliath Narendran, Wolfgang Thomas:
Obituary Robert McNaughton 1924 - 2014. Bull. EATCS 114 (2014) - [c69]Wolfgang Thomas:
Die Analyse von Kellerstrukturen: Eine Reise durch 50 Jahre Forschung. Keller, Stack und automatisches Gedächtnis 2014: 55-64 - [i9]Florian Horn, Wolfgang Thomas, Nico Wallmeier, Martin Zimmermann:
Optimal Strategy Synthesis for Request-Response Games. CoRR abs/1406.4648 (2014) - 2013
- [j29]Sten Grüner, Frank G. Radmacher, Wolfgang Thomas:
Connectivity games over dynamic networks. Theor. Comput. Sci. 493: 46-65 (2013) - 2012
- [j28]Michael Holtmann, Lukasz Kaiser, Wolfgang Thomas:
Degrees of Lookahead in Regular Infinite Games. Log. Methods Comput. Sci. 8(3) (2012) - [j27]Namit Chaturvedi, Jörg Olschewski, Wolfgang Thomas:
Languages versus ω-Languages in Regular Infinite Games. Int. J. Found. Comput. Sci. 23(5): 985-1000 (2012) - [j26]Franz Baader, Wolfgang Thomas:
Editorial. Inform. Spektrum 35(4): 247-248 (2012) - [j25]Uwe Schöning, Wolfgang Thomas:
Turings Arbeiten über Berechenbarkeit - eine Einführung und Lesehilfe. Inform. Spektrum 35(4): 253-260 (2012) - [j24]Dominik Klein, Frank G. Radmacher, Wolfgang Thomas:
Moving in a network under random failures: A complexity analysis. Sci. Comput. Program. 77(7-8): 940-954 (2012) - [c68]Wolfgang Thomas:
Synthesis and Some of Its Challenges. CAV 2012: 1 - [p4]Wolfgang Thomas:
Finite Automata and the Analysis of Infinite Transition Systems. Modern Applications of Automata Theory 2012: 495-528 - 2011
- [c67]Namit Chaturvedi, Jörg Olschewski, Wolfgang Thomas:
Languages vs. ω-Languages in Regular Infinite Games. Developments in Language Theory 2011: 180-191 - [c66]Wolfgang Thomas:
Infinite Games and Uniformization. ICLA 2011: 19-21 - [c65]Ingo Felscher, Wolfgang Thomas:
Compositional Failure Detection in Structured Transition Systems. CIAA 2011: 130-141 - [c64]Alex Spelten, Wolfgang Thomas, Sarah Winter:
Trees over Infinite Structures and Path Logics with Synchronization. INFINITY 2011: 20-34 - [c63]Sten Grüner, Frank G. Radmacher, Wolfgang Thomas:
Connectivity Games over Dynamic Networks. GandALF 2011: 131-145 - 2010
- [j23]Wolfgang Thomas:
Theoretische Informatik. Inform. Spektrum 33(5): 429-431 (2010) - [j22]Wolfgang Thomas:
Theoretische Informatik - ein Kurzprofil. Inform. Spektrum 33(5): 433-437 (2010) - [j21]Wolfgang Thomas:
"When nobody else dreamed of these things" - Axel Thue und die Termersetzung. Inform. Spektrum 33(5): 504-508 (2010) - [j20]Wolfgang Thomas, Pascal Weil:
Preface of STACS 2007 Special Issue. Theory Comput. Syst. 46(3): 397 (2010) - [c62]Wolfgang Thomas:
On Monadic Theories of Monadic Predicates. Fields of Logic and Computation 2010: 615-626 - [c61]Michael Holtmann, Lukasz Kaiser, Wolfgang Thomas:
Degrees of Lookahead in Regular Infinite Games. FoSSaCS 2010: 252-266 - [c60]James Gross, Frank G. Radmacher, Wolfgang Thomas:
A Game-Theoretic Approach to Routing under Adversarial Conditions. IFIP TCS 2010: 355-370 - [c59]Kai Bollue, Michaela Slaats, Erika Ábrahám, Wolfgang Thomas, Dirk Abel:
Synthesis of behavioral controllers for DES: Increasing efficiency. WODES 2010: 27-34 - [e11]Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas:
Advances and Applications of Automata on Words and Trees, 12.12. - 17.12.2010. Dagstuhl Seminar Proceedings 10501, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i8]Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas:
10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees. Advances and Applications of Automata on Words and Trees 2010 - [i7]Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas:
10501 Executive Summary - Advances and Applications of Automata on Words and Trees. Advances and Applications of Automata on Words and Trees 2010
2000 – 2009
- 2009
- [j19]Ingo Felscher, Wolfgang Thomas:
Compositionality and Reachability with Conditions on Path Lengths. Int. J. Found. Comput. Sci. 20(5): 851-868 (2009) - [j18]Wolfgang Thomas, Kai Bollue, Dominique Gückel, Gustavo Quiros, Michaela Slaats, Michael Ummels:
DFG Research Training Group "Algorithmic Synthesis of Reactive and Discrete-Continuous Systems (AlgoSyn)" (DFG-Graduiertenkolleg "Algorithmische Synthese reaktiver und diskret-kontinuierlicher Systeme (AlgoSyn)"). it Inf. Technol. 51(4): 222-230 (2009) - [c58]Wolfgang Thomas:
The Reachability Problem over Infinite Graphs. CSR 2009: 12-18 - [c57]Kai Bollue, Dirk Abel, Wolfgang Thomas:
Synthesis of behavioral controllers for Discrete Event Systems with NCES-like Petri net models. ECC 2009: 4786-4791 - [c56]Paul Hänsch, Michaela Slaats, Wolfgang Thomas:
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies. FCT 2009: 181-192 - [c55]Wolfgang Thomas:
Facets of Synthesis: Revisiting Church's Problem. FoSSaCS 2009: 1-14 - [c54]Dominik Klein, Frank G. Radmacher, Wolfgang Thomas:
The Complexity of Reachability in Randomized Sabotage Games. FSEN 2009: 162-177 - [e10]Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas:
Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I. Lecture Notes in Computer Science 5555, Springer 2009, ISBN 978-3-642-02926-4 [contents] - [e9]Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas:
Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II. Lecture Notes in Computer Science 5556, Springer 2009, ISBN 978-3-642-02929-5 [contents] - 2008
- [c53]Florian Horn, Wolfgang Thomas, Nico Wallmeier:
Optimal Strategy Synthesis in Request-Response Games. ATVA 2008: 361-373 - [c52]Wolfgang Thomas:
Church's Problem and a Tour through Automata Theory. Pillars of Computer Science 2008: 635-655 - [c51]Wolfgang Thomas:
Model Transformations in Decidability Proofs for Monadic Theories. CSL 2008: 23-31 - [c50]Wolfgang Thomas:
Optimizing Winning Strategies in Regular Infinite Games. SOFSEM 2008: 118-123 - [e8]Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner:
Topological and Game-Theoretic Aspects of Infinite Computations, 29.06. - 04.07.2008. Dagstuhl Seminar Proceedings 08271, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [i6]Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner:
08271 Abstracts Collection - Topological and Game-Theoretic Aspects of Infinite Computations. Topological and Game-Theoretic Aspects of Infinite Computations 2008 - [i5]Peter Hertling, Victor L. Selivanov, Wolfgang Thomas, William W. Wadge, Klaus W. Wagner:
08271 Executive Summary - Topological and Game-Theoretic Aspects of Infinite Computations. Topological and Game-Theoretic Aspects of Infinite Computations 2008 - 2007
- [b6]Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas:
Einführung in die mathematische Logik (5. Aufl.). Spektrum Akademischer Verlag 2007, pp. I-IX, 1-339 - [j17]Dieter Stoll, Wolfgang Thomas, Martin Belzner:
The role of pseudo-wires for layer 2 services in intelligent transport networks. Bell Labs Tech. J. 12(1): 207-220 (2007) - [j16]Stefan Wöhrle, Wolfgang Thomas:
Model Checking Synchronized Products of Infinite Transition Systems. Log. Methods Comput. Sci. 3(4) (2007) - [c49]Alexander Rabinovich, Wolfgang Thomas:
Logical Refinements of Church's Problem. CSL 2007: 69-83 - [c48]Frank G. Radmacher, Wolfgang Thomas:
A Game Theoretic Approach to the Analysis of Dynamic Networks. VerAS@TPHOLs 2007: 21-37 - [e7]Wolfgang Thomas, Pascal Weil:
STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings. Lecture Notes in Computer Science 4393, Springer 2007, ISBN 978-3-540-70917-6 [contents] - [i4]Stefan Wöhrle, Wolfgang Thomas:
Model Checking Synchronized Products of Infinite Transition Systems. CoRR abs/0710.5659 (2007) - 2006
- [j15]Christoph Schulte Althoff, Wolfgang Thomas, Nico Wallmeier:
Observations on determinization of Büchi automata. Theor. Comput. Sci. 363(2): 224-233 (2006) - [c47]Alexander Moshe Rabinovich, Wolfgang Thomas:
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates. CSL 2006: 562-574 - [c46]Karianto Wong, Aloys Krieg, Wolfgang Thomas:
On Intersection Problems for Polynomially Generated Sets. ICALP (2) 2006: 516-527 - [e6]Henry A. Kautz, Wolfgang Thomas, Moshe Y. Vardi:
Synthesis and Planning, 12.-17. June 2005. Dagstuhl Seminar Proceedings 05241, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [e5]Bruno Durand, Wolfgang Thomas:
STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings. Lecture Notes in Computer Science 3884, Springer 2006, ISBN 978-3-540-32301-3 [contents] - 2005
- [c45]Wolfgang Thomas:
Some Perspectives of Infinite-State Verification. ATVA 2005: 3-10 - [c44]Julien Cristau, Christof Löding, Wolfgang Thomas:
Deterministic Automata on Unranked Trees. FCT 2005: 68-79 - [c43]Christoph Schulte Althoff, Wolfgang Thomas, Nico Wallmeier:
Observations on Determinization of Büchi Automata. CIAA 2005: 262-272 - [i3]Henry A. Kautz, Wolfgang Thomas, Moshe Y. Vardi:
05241 Executive Summary - Synthesis and Planning. Synthesis and Planning 2005 - [i2]Henry A. Kautz, Wolfgang Thomas, Moshe Y. Vardi:
05241 Abstracts Collection - Synthesis and Planning. Synthesis and Planning 2005 - [i1]Wolfgang Thomas, Julien Cristau, Christof Löding:
Deterministic Automata on Unranked Trees. Foundations of Semistructured Data 2005 - 2004
- [c42]Stefan Wöhrle, Wolfgang Thomas:
Model Checking Synchronized Products of Infinite Transition Systems. LICS 2004: 2-11 - 2003
- [j14]Wolfgang Thomas:
Uniform and nonuniform recognizability. Theor. Comput. Sci. 292(1): 299-316 (2003) - [c41]Philipp Rohde, Wolfgang Thomas:
Ein e-Lecture-System für die Theoretische Informatik. DeLFI 2003: 17-26 - [c40]Wolfgang Thomas:
Constructing Infinite Graphs with a Decidable MSO-Theory. MFCS 2003: 113-124 - [c39]Nico Wallmeier, Patrick Hütten, Wolfgang Thomas:
Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications. CIAA 2003: 11-22 - 2002
- [j13]Olivier Carton, Wolfgang Thomas:
The Monadic Theory of Morphic Infinite Words and Generalizations. Inf. Comput. 176(1): 51-65 (2002) - [j12]Oliver Matz, Nicole Schweikardt, Wolfgang Thomas:
The Monadic Quantifier Alternation Hierarchy over Grids and Graphs. Inf. Comput. 179(2): 356-383 (2002) - [c38]Wolfgang Thomas:
Infinite Games and Verification (Extended Abstract of a Tutorial). CAV 2002: 58-64 - [c37]Thierry Cachat, Jacques Duparc, Wolfgang Thomas:
Solving Pushdown Games with a Sigma3 Winning Condition. CSL 2002: 322-336 - [c36]Jan-Henrik Altenbernd, Wolfgang Thomas, Stefan Wöhrle:
Tiling Systems over Infinite Pictures and Their Acceptance Conditions. Developments in Language Theory 2002: 297-306 - [e4]Erich Grädel, Wolfgang Thomas, Thomas Wilke:
Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001]. Lecture Notes in Computer Science 2500, Springer 2002, ISBN 3-540-00388-6 [contents] - 2001
- [c35]Wolfgang Thomas:
Logic for Computer Science: The Engineering Challenge. Informatics 2001: 257-267 - [c34]Wolfgang Thomas:
A Short Introduction to Infinite Automata. Developments in Language Theory 2001: 130-144 - [c33]Wolfgang Thomas:
The Engineering Challenge for Logic. LICS 2001: 173-176 - 2000
- [c32]Christof Löding, Wolfgang Thomas:
Alternating Automata and Logics over Infinite Words. IFIP TCS 2000: 521-535 - [c31]Olivier Carton, Wolfgang Thomas:
The Monadic Theory of Morphic Infinite Words and Generalizations. MFCS 2000: 275-284 - [e3]Grzegorz Rozenberg, Wolfgang Thomas:
Developments in Language Theory, Foundations, Applications, and Perspectives, Aachen, Germany, 6-9 July 1999. World Scientific 2000, ISBN 981-02-4380-4 [contents]
1990 – 1999
- 1999
- [c30]Wolfgang Thomas:
Complementation of Büchi Automata Revised. Jewels are Forever 1999: 109-120 - [p3]Wolfgang Thomas:
Die Logiken von Boole und Büchi-Elgot-Trakhtenbrot in der Beschreibung diskreter Systeme. Angewandte Mathematik, insbesondere Informatik 1999: 282-300 - [e2]Wolfgang Thomas:
Foundations of Software Science and Computation Structure, Second International Conference, FoSSaCS'99, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99, Amsterdam, The Netherlands, March 22-28, 1999, Proceedings. Lecture Notes in Computer Science 1578, Springer 1999, ISBN 3-540-65719-3 [contents] - 1998
- [c29]Wolfgang Thomas:
Monadic Logic and Automata: Recent Developments. LICS 1998: 136-138 - [e1]Mogens Nielsen, Wolfgang Thomas:
Computer Science Logic, 11th International Workshop, CSL '97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers. Lecture Notes in Computer Science 1414, Springer 1998, ISBN 3-540-64570-5 [contents] - 1997
- [c28]Wolfgang Thomas:
Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words. Structures in Logic and Computer Science 1997: 118-143 - [c27]Nils Buhrke, Wolfgang Thomas, Jens Vöge:
Ein inkrementeller Ansatz zur effizienten Synthese von Controllern aus Spezifikationen mit temporaler Logik. FBT 1997: 99-108 - [c26]Oliver Matz, Wolfgang Thomas:
The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite. LICS 1997: 236-244 - [c25]Wolfgang Thomas:
Automata Theory on Trees and Partial Orders. TAPSOFT 1997: 20-38 - [p2]Wolfgang Thomas:
Languages, Automata, and Logic. Handbook of Formal Languages (3) 1997: 389-455 - 1996
- [b5]Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas:
Einführung in die mathematische Logik (4. Aufl.). Hochschultaschenbuch, Spektrum Akadem. Verl. 1996, ISBN 978-3-8274-0130-4, pp. I-X, 1-309 - [j11]Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas:
Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems. Inf. Comput. 125(1): 32-45 (1996) - [c24]Wolfgang Thomas:
Elements of an automata theory over partial orders. Partial Order Methods in Verification 1996: 25-40 - 1995
- [j10]Howard Straubing, Denis Thérien, Wolfgang Thomas:
Regular Languages Defined with Generalized Quanifiers. Inf. Comput. 118(2): 289-301 (1995) - [c23]Ina Schiering, Wolfgang Thomas:
Counter-Free Automata, First-Order Logic and Star-Free Expressions. Developments in Language Theory 1995: 166-175 - [c22]Wolfgang Thomas:
On the Synthesis of Strategies in Infinite Games. STACS 1995: 1-13 - 1994
- [b4]Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas:
Mathematical logic (2. ed.). Undergraduate texts in mathematics, Springer 1994, ISBN 978-3-540-94258-0, pp. I-X, 1-289 - [c21]Wolfgang Thomas:
Finite-State Strategies in Regular Infinite Games. FSTTCS 1994: 149-158 - [c20]Wolfgang Thomas:
Finite-State Recognizability and Logic: from Words to Graphs. IFIP Congress (1) 1994: 499-506 - [c19]Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas:
Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems. STACS 1994: 365-375 - 1993
- [c18]Kurt Mehlhorn, Volker Claus, Wolfgang Thomas:
Komplexitätstheorie und Algorithmik. Perspektiven der Informatik 1993: 113-116 - [c17]Wolfgang Thomas:
Logik in der Informatik. Perspektiven der Informatik 1993: 116-120 - [c16]Wolfgang Thomas:
Semantik und Verifikation. Perspektiven der Informatik 1993: 120-124 - [c15]Eija Jurvanen, Andreas Potthoff, Wolfgang Thomas:
Tree Languages Recognizable by Regular Frontier Check. Developments in Language Theory 1993: 3-17 - [c14]Andreas Potthoff, Wolfgang Thomas:
Regular Tree Languages Without Unary Symbols are Star-Free. FCT 1993: 396-405 - [c13]Wolfgang Thomas, Helmut Lescow:
Logical Specifications of Infinite Computations. REX School/Symposium 1993: 583-621 - [c12]Wolfgang Thomas:
On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science. TAPSOFT 1993: 559-568 - 1992
- [b3]Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas:
Einführung in die mathematische Logik (3. Aufl.). BI-Wissenschaftsverlag 1992, ISBN 978-3-411-15603-0, pp. I-X, 1-338 - [j9]Wolfgang Thomas:
Infinite Trees and Automation-Definable Relations over omega-Words. Theor. Comput. Sci. 103(1): 143-159 (1992) - 1991
- [c11]Wolfgang Thomas:
On Logics, Tilings, and Automata. ICALP 1991: 441-454 - 1990
- [c10]Wolfgang Thomas:
Infinite Trees and Automaton Definable Relations over Omega-Words. STACS 1990: 263-277 - [p1]Wolfgang Thomas:
Automata on Infinite Objects. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 133-191
1980 – 1989
- 1989
- [c9]V. Kell, Albert Maier, Andreas Potthoff, Wolfgang Thomas, U. Wermuth:
AMORE: A System for Computing Automata, MOnoids, and Regular Expressions. STACS 1989: 537-538 - 1988
- [c8]Howard Straubing, Denis Thérien, Wolfgang Thomas:
regular Languages Defined with Generalized Quantifiers. ICALP 1988: 561-575 - [c7]Wolfgang Thomas:
Automata and quantifier hierarchies. Formal Properties of Finite Automata and Applications 1988: 104-119 - [c6]Wolfgang Thomas:
Computation tree logic and regular omega-languages. REX Workshop 1988: 690-713 - 1987
- [c5]Wolfgang Thomas:
A Concatenation Game and the Dot-Depth Hierarchy. Computation Theory and Logic 1987: 415-426 - [c4]Thilo Hafer, Wolfgang Thomas:
Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree. ICALP 1987: 269-279 - [c3]Wolfgang Thomas:
On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees. LICS 1987: 245-256 - 1986
- [j8]Wolfgang Thomas:
On Frontiers of Regular Trees. RAIRO Theor. Informatics Appl. 20(4): 371-381 (1986) - 1985
- [j7]Walter Oberschelp, Britta Schinzel, Wolfgang Thomas, Michael M. Richter:
European Summer Meeting of the Association for Symbolic Logic: Aachen, 1983. J. Symb. Log. 50(1): 259-283 (1985) - 1984
- [b2]Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas:
Mathematical logic. Undergraduate texts in mathematics, Springer 1984, ISBN 978-0-387-90895-3, pp. I-IX, 1-216 - [c2]Wolfgang Thomas:
Logical Aspects in the Study of Tree Languages. CAAP 1984: 31-50 - 1983
- [c1]Wolfgang Thomas:
A hierarchy of sets of infinite trees. Theoretical Computer Science 1983: 335-342 - 1982
- [j6]Wolfgang Thomas:
Classifying Regular Events in Symbolic Logic. J. Comput. Syst. Sci. 25(3): 360-376 (1982) - 1981
- [j5]Wolfgang Thomas:
A Combinatorial Approach to the Theory of omega-Automata. Inf. Control. 48(3): 261-283 (1981) - [j4]Wolfgang Thomas:
Remark on the Star-Height-Problem. Theor. Comput. Sci. 13: 231-237 (1981) - 1980
- [j3]Wolfgang Thomas:
On the Bounded Monadic Theory of Well-Ordered Structures. J. Symb. Log. 45(2): 334-338 (1980)
1970 – 1979
- 1979
- [j2]Wolfgang Thomas:
Star-Free Regular Sets of omega-Sequences. Inf. Control. 42(2): 148-156 (1979) - 1975
- [b1]Wolfgang Thomas:
Das Entscheidungsproblem für einige Erweiterungen der Nachfolger-Arithmetik. Universität Freiburg, 1975, pp. 1-103 - [j1]Wolfgang Thomas:
A note on undecidable extensions of monadic second order successor arithmetic. Arch. Math. Log. 17(1-2): 43-44 (1975)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-28 23:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
