Wolfgang Thomas - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Languages vs. ::::ω::::-Languages in Regular Infinite GamesNamit Chaturvedi, Jörg Olschewski, Wolfgang Thomas. dlt 2011: 180-191 [doi]

Compositional Failure Detection in Structured Transition SystemsIngo Felscher, Wolfgang Thomas. wia 2011: 130-141 [doi]

Infinite Games and UniformizationWolfgang Thomas. icla 2011: 19-21 [doi]

2010

A Game-Theoretic Approach to Routing under Adversarial ConditionsJames Gross, Frank G. Radmacher, Wolfgang Thomas. ifipTCS 2010: 355-370 [doi]

Degrees of Lookahead in Regular Infinite GamesMichael Holtmann, Lukasz Kaiser, Wolfgang Thomas. fossacs 2010: 252-266 [doi]

When nobody else dreamed of these things - Axel Thue und die TermersetzungWolfgang Thomas. insk, 33(5):504-508, 2010. [doi]

Theoretische Informatik - ein KurzprofilWolfgang Thomas. insk, 33(5):433-437, 2010. [doi]

On Monadic Theories of Monadic PredicatesWolfgang Thomas. BIRTHDAY 2010: 615-626 [doi]

Theoretische InformatikWolfgang Thomas. insk, 33(5):429-431, 2010. [doi]

Preface of STACS 2007 Special IssueWolfgang Thomas, Pascal Weil. mst, 46(3):397, 2010. [doi]

2009

Automata, Languages and Programming, 36th Internatilonal Collogquium, ICALP 2009, Rhodes, greece, July 5-12, 2009, Proceedings, Part IISusanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas, editors, Volume 5556 of Lecture Notes in Computer Science, Springer, 2009. [doi]

Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part ISusanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas, Wolfgang Thomas, editors, Volume 5555 of Lecture Notes in Computer Science, Springer, 2009. [doi]

Compositionality and Reachability with Conditions on Path LengthsIngo Felscher, Wolfgang Thomas. ijfcs, 20(5):851-868, 2009. [doi]

Parametrized Regular Infinite Games and Higher-Order Pushdown StrategiesPaul HÃ¤nsch, Michaela Slaats, Wolfgang Thomas. fct 2009: 181-192 [doi]

The Complexity of Reachability in Randomized Sabotage GamesDominik Klein, Frank G. Radmacher, Wolfgang Thomas. fsen 2010: 162-177 [doi]

Facets of Synthesis: Revisiting Church s ProblemWolfgang Thomas. fossacs 2009: 1-14 [doi]

DFG Research Training Group Algorithmic Synthesis of Reactive and Discrete-Continuous Systems (AlgoSyn) (DFG-Graduiertenkolleg Algorithmische Synthese reaktiver und diskret-kontinuierlicher Systeme (AlgoSyn) )Wolfgang Thomas, Kai Bollue, Dominique GÃ¼ckel, Gustavo Quiros, Michaela Slaats, Michael Ummels. it, 51(4):222-230, 2009. [doi]

The Reachability Problem over Infinite GraphsWolfgang Thomas. csr 2009: 12-18 [doi]

2008

2007

Einführung in die mathematische Logik (5. Aufl.)Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas. Spektrum Akademischer Verlag, 2007.

Logical Refinements of Church s ProblemAlexander Rabinovich, Wolfgang Thomas. csl 2007: 69-83 [doi]

The role of pseudo-wires for layer 2 services in intelligent transport networksDieter Stoll, Wolfgang Thomas, Martin Belzner. bell, 12(1):207-220, 2007. [doi]

STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, ProceedingsWolfgang Thomas, Pascal Weil, editors, Volume 4393 of Lecture Notes in Computer Science, Springer, 2007.

Model Checking Synchronized Products of Infinite Transition SystemsStefan Wöhrle, Wolfgang Thomas. lmcs, 3(4), 2007. [doi]

2006

Observations on determinization of Büchi automataChristoph Schulte Althoff, Wolfgang Thomas, Nico Wallmeier. TCS, 363(2):224-233, 2006. [doi]

STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, ProceedingsBruno Durand, Wolfgang Thomas, editors, Volume 3884 of Lecture Notes in Computer Science, Springer, 2006.

On Intersection Problems for Polynomially Generated SetsWong Karianto, Aloys Krieg, Wolfgang Thomas. icalp 2006: 516-527 [doi]

Synthesis and Planning, 12.-17. June 2005Henry A. Kautz, Wolfgang Thomas, Moshe Y. Vardi, editors, Volume 05241 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, 2006.

Decidable Theories of the Ordering of Natural Numbers with Unary PredicatesAlexander Moshe Rabinovich, Wolfgang Thomas. csl 2006: 562-574 [doi]

2005

2004

Model Checking Synchronized Products of Infinite Transition SystemsStefan Wöhrle, Wolfgang Thomas. lics 2004: 2-11 [doi]

2003

Ein e-Lecture-System für die Theoretische InformatikPhilipp Rohde, Wolfgang Thomas. delfi 2003: 17-26

Uniform and nonuniform recognizabilityWolfgang Thomas. TCS, 292(1):299-316, 2003.

Constructing Infinite Graphs with a Decidable MSO-TheoryWolfgang Thomas. mfcs 2003: 113-124 [doi]

Symbolic Synthesis of Finite-State Controllers for Request-Response SpecificationsNico Wallmeier, Patrick Hütten, Wolfgang Thomas. wia 2003: 11-22 [doi]

2002

Tiling Systems over Infinite Pictures and Their Acceptance ConditionsJan-Henrik Altenbernd, Wolfgang Thomas, Stefan Wöhrle. dlt 2003: 297-306 [doi]

Solving Pushdown Games with a Sigma::3:: Winning ConditionThierry Cachat, Jacques Duparc, Wolfgang Thomas. csl 2002: 322-336 [doi]

The Monadic Theory of Morphic Infinite Words and GeneralizationsOlivier Carton, Wolfgang Thomas. iandc, 176(1):51-65, 2002. [doi]

Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001]Erich Grädel, Wolfgang Thomas, Thomas Wilke, editors, Volume 2500 of Lecture Notes in Computer Science, Springer, 2002.

The Monadic Quantifier Alternation Hierarchy over Grids and GraphsOliver Matz, Nicole Schweikardt, Wolfgang Thomas. iandc, 179(2):356-383, 2002. [doi]

Infinite Games and Verification (Extended Abstract of a Tutorial)Wolfgang Thomas. cav 2002: 58-64 [doi]

2001

A Short Introduction to Infinite AutomataWolfgang Thomas. dlt 2002: 130-144 [doi]

The Engineering Challenge for LogicWolfgang Thomas. lics 2001:

Logic for Computer Science: The Engineering ChallengeWolfgang Thomas. dagstuhl 2001: 257-267 [doi]

2000

The Monadic Theory of Morphic Infinite Words and GeneralizationsOlivier Carton, Wolfgang Thomas. mfcs 2000: 275-284 [doi]

Alternating Automata and Logics over Infinite WordsChristof Löding, Wolfgang Thomas. ifipTCS 2000: 521-535 [doi]

Developments in Language Theory, Foundations, Applications, and Perspectives, Aachen, Germany, 6-9 July 1999Grzegorz Rozenberg, Wolfgang Thomas, editors, World Scientific, 2000.

1999

Complementation of Büchi Automata RevisedWolfgang Thomas. BIRTHDAY 1999: 109-120

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, ProceedWolfgang Thomas, editor, Volume 1578 of Lecture Notes in Computer Science, Springer, 1999.

1998

Computer Science Logic, 11th International Workshop, CSL 97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected PapersMogens Nielsen, Wolfgang Thomas, editors, Volume 1414 of Lecture Notes in Computer Science, Springer, 1998.

Monadic Logic and Automata: Recent DevelopmentsWolfgang Thomas. lics 1998: 136-138

1997

Ein inkrementeller Ansatz zur effizienten Synthese von Controllern aus Spezifikationen mit temporaler LogikNils Buhrke, Wolfgang Thomas, Jens Vöge. fbt 1997: 99-108

The Monadic Quantifier Alternation Hierarchy over Graphs is InfiniteOliver Matz, Wolfgang Thomas. lics 1997: 236-244 [doi]

Automata Theory on Trees and Partial OrdersWolfgang Thomas. tapsoft 1997: 20-38

Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal WordsWolfgang Thomas. BIRTHDAY 1997: 118-143

1996

Einführung in die mathematische Logik (4. Aufl.)Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas. Hochschultaschenbuch, Spektrum Akadem. Verl., 1996.

Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling SystemsDora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas. iandc, 125(1):32-45, 1996.

1995

Counter-Free Automata, First-Order Logic and Star-Free ExpressionsIna Schiering, Wolfgang Thomas. dlt 1995: 166-175

Regular Languages Defined with Generalized QuanifiersHoward Straubing, Denis Thérien, Wolfgang Thomas. iandc, 118(2):289-301, May 1995.

On the Synthesis of Strategies in Infinite GamesWolfgang Thomas. STACS 1995: 1-13

1994

Mathematical logic (2. ed.)Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas. Undergraduate texts in mathematics, Springer, 1994.

Monadic Second-Order Logic Over Pictures and Recognizability by Tiling SystemsDora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas. STACS 1994: 365-375

Finite-State Strategies in Regular Infinite GamesWolfgang Thomas. fsttcs 1994: 149-158

Finite-State Recognizability and Logic: from Words to GraphsWolfgang Thomas. ifip11-9 1994: 499-506

1993

1992

Einführung in die mathematische Logik (3. Aufl.)Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas. BI-Wissenschaftsverlag, 1992.

Infinite Trees and Automation-Definable Relations over omega-WordsWolfgang Thomas. TCS, 103(1):143-159, 1992.

1991

On Logics, Tilings, and AutomataWolfgang Thomas. icalp 1991: 441-454

1990

Infinite Trees and Automaton Definable Relations over Omega-WordsWolfgang Thomas. STACS 1990: 263-277

Automata on Infinite ObjectsWolfgang Thomas. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B). pages 133-192, 1990.

1989

AMORE: A System for Computing Automata, MOnoidsm and Regular ExpressionsV. Kell, Albert Maier, Andreas Potthoff, Wolfgang Thomas, U. Wermuth. STACS 1989: 537-538

1988

regular Languages Defined with Generalized QuantifiersHoward Straubing, Denis Thérien, Wolfgang Thomas. icalp 1988: 561-575

Automata and quantifier hierarchiesWolfgang Thomas. litp 1989: 104-119

Computation tree logic and regular omega-languagesWolfgang Thomas. rex 1989: 690-713

1987

Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary TreeThilo Hafer, Wolfgang Thomas. icalp 1987: 269-279

A Concatenation Game and the Dot-Depth HierarchyWolfgang Thomas. BIRTHDAY 1987: 415-426

On Chain Logic, Path Logic, and First-Order Logic over Infinite TreesWolfgang Thomas. lics 1987: 245-256

1986

On Frontiers of Regular TreesWolfgang Thomas. ita, 20(4):371-381, 1986.

1985

European Summer Meeting of the Association for Symbolic Logic: Aachen, 1983Walter Oberschelp, Britta Schinzel, Wolfgang Thomas, Michael M. Richter. JSYML, 50(1):259-283, 1985.

1984

Mathematical logicHeinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas. Undergraduate texts in mathematics, Springer, 1984.

Logical Aspects in the Study of Tree LanguagesWolfgang Thomas. caap 1984: 31-50

1983

A hierarchy of sets of infinite treesWolfgang Thomas. tcs 1982: 335-342

1982

Classifying Regular Events in Symbolic LogicWolfgang Thomas. jcss, 25(3):360-376, 1982.

1981

Remark on the Star-Height-ProblemWolfgang Thomas. TCS, 13:231-237, 1981.

A Combinatorial Approach to the Theory of omega-AutomataWolfgang Thomas. iandc, 48(3):261-283, March 1981.

PreviousNext