 | 2010 |
|---|
| 89 |       | Wolfgang Thomas,
Pascal Weil:
Preface of STACS 2007 Special Issue.
Theory Comput. Syst. 46(3): 397 (2010) |
| 2009 |
|---|
| 88 | | 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
Springer 2009 |
| 87 | | Susanne Albers,
Alberto Marchetti-Spaccamela,
Yossi Matias,
Sotiris E. Nikoletseas,
Wolfgang Thomas:
Automata, Languages and Programming, 36th Internatilonal Collogquium, ICALP 2009, Rhodes, greece, July 5-12, 2009, Proceedings, Part II
Springer 2009 |
| 86 | | Wolfgang Thomas:
The Reachability Problem over Infinite Graphs.
CSR 2009: 12-18 |
| 85 | | Paul Hänsch,
Michaela Slaats,
Wolfgang Thomas:
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies.
FCT 2009: 181-192 |
| 84 | | Wolfgang Thomas:
Facets of Synthesis: Revisiting Church's Problem.
FOSSACS 2009: 1-14 |
| 83 | | Dominik Klein,
Frank G. Radmacher,
Wolfgang Thomas:
The Complexity of Reachability in Randomized Sabotage Games.
FSEN 2009: 162-177 |
| 82 | | Ingo Felscher,
Wolfgang Thomas:
Compositionality and Reachability with Conditions on Path Lengths.
Int. J. Found. Comput. Sci. 20(5): 851-868 (2009) |
| 81 | | 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 - Information Technology 51(4): 222-230 (2009) |
| 2008 |
|---|
| 80 | | Florian Horn,
Wolfgang Thomas,
Nico Wallmeier:
Optimal Strategy Synthesis in Request-Response Games.
ATVA 2008: 361-373 |
| 79 | | Wolfgang Thomas:
Model Transformations in Decidability Proofs for Monadic Theories.
CSL 2008: 23-31 |
| 78 | | Wolfgang Thomas:
Church's Problem and a Tour through Automata Theory.
Pillars of Computer Science 2008: 635-655 |
| 77 | | Wolfgang Thomas:
Optimizing Winning Strategies in Regular Infinite Games.
SOFSEM 2008: 118-123 |
| 76 | | Frank G. Radmacher,
Wolfgang Thomas:
A Game Theoretic Approach to the Analysis of Dynamic Networks.
Electr. Notes Theor. Comput. Sci. 200(2): 21-37 (2008) |
| 2007 |
|---|
| 75 |  | Wolfgang Thomas,
Pascal Weil:
STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings
Springer 2007 |
| 74 | | Alexander Rabinovich,
Wolfgang Thomas:
Logical Refinements of Church's Problem.
CSL 2007: 69-83 |
| 73 | | Dieter Stoll,
Wolfgang Thomas,
Martin Belzner:
The role of pseudo-wires for layer 2 services in intelligent transport networks.
Bell Labs Technical Journal 12(1): 207-220 (2007) |
| 72 | | Stefan Wöhrle,
Wolfgang Thomas:
Model Checking Synchronized Products of Infinite Transition Systems
CoRR abs/0710.5659: (2007) |
| 71 | | Stefan Wöhrle,
Wolfgang Thomas:
Model Checking Synchronized Products of Infinite Transition Systems.
Logical Methods in Computer Science 3(4): (2007) |
| 2006 |
|---|
| 70 | | Henry A. Kautz,
Wolfgang Thomas,
Moshe Y. Vardi:
Synthesis and Planning, 12.-17. June 2005
Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 69 | | Bruno Durand,
Wolfgang Thomas:
STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings
Springer 2006 |
| 68 | | Alexander Moshe Rabinovich,
Wolfgang Thomas:
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates.
CSL 2006: 562-574 |
| 67 | | Karianto Wong,
Aloys Krieg,
Wolfgang Thomas:
On Intersection Problems for Polynomially Generated Sets.
ICALP (2) 2006: 516-527 |
| 66 | | Christoph Schulte Althoff,
Wolfgang Thomas,
Nico Wallmeier:
Observations on determinization of Büchi automata.
Theor. Comput. Sci. 363(2): 224-233 (2006) |
| 2005 |
|---|
| 65 | | Wolfgang Thomas:
Some Perspectives of Infinite-State Verification.
ATVA 2005: 3-10 |
| 64 | | Christoph Schulte Althoff,
Wolfgang Thomas,
Nico Wallmeier:
Observations on Determinization of Büchi Automata.
CIAA 2005: 262-272 |
| 63 | | Julien Cristau,
Christof Löding,
Wolfgang Thomas:
Deterministic Automata on Unranked Trees.
FCT 2005: 68-79 |
| 62 | | Wolfgang Thomas,
Julien Cristau,
Christof Löding:
Deterministic Automata on Unranked Trees.
Foundations of Semistructured Data 2005 |
| 61 | | Henry A. Kautz,
Wolfgang Thomas,
Moshe Y. Vardi:
05241 Abstracts Collection - Synthesis and Planning.
Synthesis and Planning 2005 |
| 60 | | Henry A. Kautz,
Wolfgang Thomas,
Moshe Y. Vardi:
05241 Executive Summary - Synthesis and Planning.
Synthesis and Planning 2005 |
| 2004 |
|---|
| 59 | | Stefan Wöhrle,
Wolfgang Thomas:
Model Checking Synchronized Products of Infinite Transition Systems.
LICS 2004: 2-11 |
| 2003 |
|---|
| 58 | | Nico Wallmeier,
Patrick Hütten,
Wolfgang Thomas:
Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications.
CIAA 2003: 11-22 |
| 57 | | Philipp Rohde,
Wolfgang Thomas:
Ein e-Lecture-System für die Theoretische Informatik.
DeLFI 2003: 17-26 |
| 56 | | Wolfgang Thomas:
Constructing Infinite Graphs with a Decidable MSO-Theory.
MFCS 2003: 113-124 |
| 55 | | Wolfgang Thomas:
Uniform and nonuniform recognizability.
Theor. Comput. Sci. 292(1): 299-316 (2003) |
| 2002 |
|---|
| 54 | | Erich Grädel,
Wolfgang Thomas,
Thomas Wilke:
Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001]
Springer 2002 |
| 53 | | Wolfgang Thomas:
Infinite Games and Verification (Extended Abstract of a Tutorial).
CAV 2002: 58-64 |
| 52 | | Thierry Cachat,
Jacques Duparc,
Wolfgang Thomas:
Solving Pushdown Games with a Sigma3 Winning Condition.
CSL 2002: 322-336 |
| 51 | | Jan-Henrik Altenbernd,
Wolfgang Thomas,
Stefan Wöhrle:
Tiling Systems over Infinite Pictures and Their Acceptance Conditions.
Developments in Language Theory 2002: 297-306 |
| 50 | | Olivier Carton,
Wolfgang Thomas:
The Monadic Theory of Morphic Infinite Words and Generalizations.
Inf. Comput. 176(1): 51-65 (2002) |
| 49 | | Oliver Matz,
Nicole Schweikardt,
Wolfgang Thomas:
The Monadic Quantifier Alternation Hierarchy over Grids and Graphs.
Inf. Comput. 179(2): 356-383 (2002) |
| 2001 |
|---|
| 48 | | Wolfgang Thomas:
A Short Introduction to Infinite Automata.
Developments in Language Theory 2001: 130-144 |
| 47 | | Wolfgang Thomas:
Logic for Computer Science: The Engineering Challenge.
Informatics 2001: 257-267 |
| 46 | | Wolfgang Thomas:
The Engineering Challenge for Logic.
LICS 2001 |
| 2000 |
|---|
| 45 | | Grzegorz Rozenberg,
Wolfgang Thomas:
Developments in Language Theory, Foundations, Applications, and Perspectives, Aachen, Germany, 6-9 July 1999
World Scientific 2000 |
| 44 | | Christof Löding,
Wolfgang Thomas:
Alternating Automata and Logics over Infinite Words.
IFIP TCS 2000: 521-535 |
| 43 | | Olivier Carton,
Wolfgang Thomas:
The Monadic Theory of Morphic Infinite Words and Generalizations.
MFCS 2000: 275-284 |
| 1999 |
|---|
| 42 | | 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
Springer 1999 |
| 41 | | Wolfgang Thomas:
Complementation of Büchi Automata Revised.
Jewels are Forever 1999: 109-120 |
| 1998 |
|---|
| 40 | | 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
Springer 1998 |
| 39 | | Wolfgang Thomas:
Monadic Logic and Automata: Recent Developments.
LICS 1998: 136-138 |
| 1997 |
|---|
| 38 | | Nils Buhrke,
Wolfgang Thomas,
Jens Vöge:
Ein inkrementeller Ansatz zur effizienten Synthese von Controllern aus Spezifikationen mit temporaler Logik.
FBT 1997: 99-108 |
| 37 | | Oliver Matz,
Wolfgang Thomas:
The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite.
LICS 1997: 236-244 |
| 36 | | Wolfgang Thomas:
Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words.
Structures in Logic and Computer Science 1997: 118-143 |
| 35 | | Wolfgang Thomas:
Automata Theory on Trees and Partial Orders.
TAPSOFT 1997: 20-38 |
| 1996 |
|---|
| 34 | | 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) |
| 1995 |
|---|
| 33 | | Ina Schiering,
Wolfgang Thomas:
Counter-Free Automata, First-Order Logic and Star-Free Expressions.
Developments in Language Theory 1995: 166-175 |
| 32 | | Wolfgang Thomas:
On the Synthesis of Strategies in Infinite Games.
STACS 1995: 1-13 |
| 31 | | Howard Straubing,
Denis Thérien,
Wolfgang Thomas:
Regular Languages Defined with Generalized Quanifiers
Inf. Comput. 118(2): 289-301 (1995) |
| 1994 |
|---|
| 30 | | Wolfgang Thomas:
Finite-State Strategies in Regular Infinite Games.
FSTTCS 1994: 149-158 |
| 29 | | Wolfgang Thomas:
Finite-State Recognizability and Logic: from Words to Graphs.
IFIP Congress (1) 1994: 499-506 |
| 28 | | Dora Giammarresi,
Antonio Restivo,
Sebastian Seibert,
Wolfgang Thomas:
Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems.
STACS 1994: 365-375 |
| 1993 |
|---|
| 27 | | Eija Jurvanen,
Andreas Potthoff,
Wolfgang Thomas:
Tree Languages Recognizable by Regular Frontier Check.
Developments in Language Theory 1993: 3-17 |
| 26 | | Andreas Potthoff,
Wolfgang Thomas:
Regular Tree Languages Without Unary Symbols are Star-Free.
FCT 1993: 396-405 |
| 25 | | Kurt Mehlhorn,
Volker Claus,
Wolfgang Thomas:
Komplexitätstheorie und Algorithmik.
Perspektiven der Informatik 1993: 113-116 |
| 24 | | Wolfgang Thomas:
Logik in der Informatik.
Perspektiven der Informatik 1993: 116-120 |
| 23 | | Wolfgang Thomas:
Semantik und Verifikation.
Perspektiven der Informatik 1993: 120-124 |
| 22 | | Wolfgang Thomas,
Helmut Lescow:
Logical Specifications of Infinite Computations.
REX School/Symposium 1993: 583-621 |
| 21 | | Wolfgang Thomas:
On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science.
TAPSOFT 1993: 559-568 |
| 1992 |
|---|
| 20 | | Wolfgang Thomas:
Infinite Trees and Automation-Definable Relations over omega-Words.
Theor. Comput. Sci. 103(1): 143-159 (1992) |
| 1991 |
|---|
| 19 | | Wolfgang Thomas:
On Logics, Tilings, and Automata.
ICALP 1991: 441-454 |
| 1990 |
|---|
| 18 | | Wolfgang Thomas:
Infinite Trees and Automaton Definable Relations over Omega-Words.
STACS 1990: 263-277 |
| 17 | | Wolfgang Thomas:
Automata on Infinite Objects.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 133-192 |
| 1989 |
|---|
| 16 | | V. Kell,
Albert Maier,
Andreas Potthoff,
Wolfgang Thomas,
U. Wermuth:
AMORE: A System for Computing Automata, MOnoidsm and Regular Expressions.
STACS 1989: 537-538 |
| 1988 |
|---|
| 15 | | Wolfgang Thomas:
Automata and quantifier hierarchies.
Formal Properties of Finite Automata and Applications 1988: 104-119 |
| 14 | | Howard Straubing,
Denis Thérien,
Wolfgang Thomas:
regular Languages Defined with Generalized Quantifiers.
ICALP 1988: 561-575 |
| 13 | | Wolfgang Thomas:
Computation tree logic and regular omega-languages.
REX Workshop 1988: 690-713 |
| 1987 |
|---|
| 12 | | Wolfgang Thomas:
A Concatenation Game and the Dot-Depth Hierarchy.
Computation Theory and Logic 1987: 415-426 |
| 11 | | Thilo Hafer,
Wolfgang Thomas:
Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree.
ICALP 1987: 269-279 |
| 10 | | Wolfgang Thomas:
On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees
LICS 1987: 245-256 |
| 1986 |
|---|
| 9 | | Wolfgang Thomas:
On Frontiers of Regular Trees.
ITA 20(4): 371-381 (1986) |
| 1985 |
|---|
| 8 | | 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 |
|---|
| 7 | | Wolfgang Thomas:
Logical Aspects in the Study of Tree Languages.
CAAP 1984: 31-50 |
| 1983 |
|---|
| 6 | | Wolfgang Thomas:
A hierarchy of sets of infinite trees.
Theoretical Computer Science 1983: 335-342 |
| 1982 |
|---|
| 5 | | Wolfgang Thomas:
Classifying Regular Events in Symbolic Logic.
J. Comput. Syst. Sci. 25(3): 360-376 (1982) |
| 1981 |
|---|
| 4 | | Wolfgang Thomas:
A Combinatorial Approach to the Theory of omega-Automata
Information and Control 48(3): 261-283 (1981) |
| 3 | | Wolfgang Thomas:
Remark on the Star-Height-Problem.
Theor. Comput. Sci. 13: 231-237 (1981) |
| 1980 |
|---|
| 2 | | Wolfgang Thomas:
On the Bounded Monadic Theory of Well-Ordered Structures.
J. Symb. Log. 45(2): 334-338 (1980) |
| 1979 |
|---|
| 1 | | Wolfgang Thomas:
Star-Free Regular Sets of omega-Sequences
Information and Control 42(2): 148-156 (1979) |
