Publikationen von Wolfgang Thomas

Ausgewählte Publikationen

2012

[COT12] N. Chaturvedi, J. Olschewski, and W. Thomas. Languages vs. omega-languages in regular infinite games. International Journal of Foundations of Computer Science, 23(05):985-1000, August 2012. Journal version of [COT11]. (c) 2012 World Scientific Publishing Company.
[ pdf | http | Abstract ]
[GRT12] Sten Grüner, Frank G. Radmacher, and Wolfgang Thomas. Connectivity games over dynamic networks. Theoretical Computer Science, 2012. Extended version of [RT07b] and [GRT11]. (c) Elsevier.
[ pdf | Abstract ]

2011

[COT11] N. Chaturvedi, J. Olschewski, and W. Thomas. Languages vs. omega-languages in regular infinite games. In Giancarlo Mauri and Alberto Leporati, editors, Proceedings of the 15th International Conference on Developments in Language Theory, DLT 2011, volume 6795 of Lecture Notes in Computer Science, pages 180-191. Springer, 2011.
[ pdf | http | Abstract ]
[FT11b] I. Felscher and W. Thomas. On Compositional Failure Detection in Structured Transition Systems. Technical Report AIB-2011-12, RWTH Aachen University, 2011. Full version of [FT11a].
[ pdf | .ps.gz | Abstract ]
[FT11a] I. Felscher and W. Thomas. Compositional failure detection in structured transition systems. In Implementation and Application of Automata, 16th International Conference, CIAA 2011, Blois, France, July 13-16, 2011. Proceedings, volume 6807 of Lecture Notes of Computer Science, pages 130-141, 2011.
[ http | Abstract ]
[GRT11] Sten Grüner, Frank G. Radmacher, and Wolfgang Thomas. Connectivity games over dynamic networks. In Proceedings of the 2nd International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2011, volume 54 of Electronic Proceedings in Theoretical Computer Science, pages 131-145, 2011.
[ pdf | Abstract ]
[STW11] Alex Spelten, Wolfgang Thomas, and Sarah Winter. Trees over infinite structures and path logics with synchronization. In Fang Yu and Chao Wang, editors, Proceedings of the 13th International Workshop on Verification of Infinite-State Systems, volume 73 of EPTCS, pages 20-34, 2011.
[ pdf | Abstract ]
[Tho11] W. Thomas. Infinite games and uniformization. In M. Banerjee and A. Seth, editors, Proceedings of the 4th Indian Conference on Logic and Its Applications, ICLA 2011, volume 6521 of Lecture Notes in Computer Science, pages 19-21. Springer, 2011. (c) Springer.
[ pdf | Abstract ]

2010

[BSA+10] K. Bollue, M. Slaats, E. Abraham, W. Thomas, and D. Abel. Synthesis of Behavioral Controllers for DES: Increasing Efficiency. In 10th Int. Workshop on Discrete-Event Systems (WODES'10), IFAC, pages 30-37, 2010.
[ pdf | Abstract ]
[GRT10] James Gross, Frank G. Radmacher, and Wolfgang Thomas. A game-theoretic approach to routing under adversarial conditions. In Proceedings of the 6th IFIP International Conference on Theoretical Computer Science, IFIP TCS 2010, volume 323 of IFIP Advances in Information and Communication Technology, pages 355-370. Springer, 2010. (c) IFIP.
[ pdf | Abstract ]
[HKT10] Michael Holtmann, Łukasz Kaiser, and Wolfgang Thomas. Degrees of Lookahead in Regular Infinite Games. In Luke Ong, editor, Foundations of Software Science and Computational Structures, volume 6014 of Lecture Notes in Computer Science, pages 252-266. Springer, 2010.
[ Abstract ]
[KRT10] Dominik Klein, Frank G. Radmacher, and Wolfgang Thomas. Moving in a network under random failures: A complexity analysis. Science of Computer Programming, 77(7-8):940-954, 2010. Extended version of [KRT09]. (c) Elsevier.
[ pdf | Abstract ]
[Tho10a] W. Thomas. On monadic theories of monadic predicates. In A. Blass, N. Dershowitz, and W. Reisig, editors, Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, volume 6300 of Lecture Notes in Computer Science, pages 615-626. Springer, 2010.
[ pdf | Abstract ]
[Tho10b] W. Thomas. Theoretische Informatik. Informatik Spektrum, 33(5):429-431, 2010. (c) Springer.
[Tho10c] W. Thomas. Theoretische Informatik - ein Kurzprofil. Informatik Spektrum, 33(5):433-437, 2010. (c) Springer.
[ pdf ]
[Tho10d] W. Thomas. When nobody else dreamed of these things - Axel Thue und die Termersetzung. Informatik Spektrum, 33(5):504-508, 2010. (c) Springer.
[ pdf ]
[TW10] W. Thomas and P. Weil. Preface of STACS 2007 Special Issue. Theory Comput. Syst., 46(3):397, 2010.

2009

[AMSM+09] S. Albers, A. Marchetti-Spaccamela, Y. Matias, S.E. Nikoletseas, and W. Thomas, editors. Proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, Part I and II, volume 5555 and 5556 of Lecture Notes in Computer Science. Springer, 2009.
[BAT09] K. Bollue, D. Abel, and W. Thomas. Synthesis of behavioral controllers for discrete event systems with NCES-like Petri net models. In Proceedings of the European Control Conference, ECC 2009, 2009.
[ Abstract ]
[FT09] I. Felscher and W. Thomas. Compositionality and reachability with conditions on path lengths. International Journal of Foundations of Computer Science, 20(5):851-868, 2009. (c) World Scientific Publishing Company.
[ pdf | http | Abstract ]
[HST09a] P. Hänsch, M. Slaats, and W. Thomas. Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies. In FCT 2009, volume 5699 of lncs, pages 181-192. Springer, 2009. A preliminary version is accepted at the conference AutoMathA 2009, Automata: from Mathematics to Applications, Liège, Belgium. (c) Springer.
[ pdf | Abstract ]
[HST09b] P. Hänsch, M. Slaats, and W. Thomas. Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies. Technical Report AIB-2009-18, RWTH Aachen, sep 2009. Full version of [HST09a].
[ pdf | ps | Abstract ]
[KRT09] Dominik Klein, Frank G. Radmacher, and Wolfgang Thomas. The complexity of reachability in randomized sabotage games. In Proceedings of the 3rd International Conference on Fundamentals of Software Engineering, FSEN 2009, volume 5961 of Lecture Notes in Computer Science, pages 162-177. Springer, 2009. (c) Springer.
[ pdf | Abstract ]
[Tho09c] W. Thomas. The reachability problem over infinite graphs. In A E. Frid, A. Morozov, A. Rybalchenko, and K. W. Wagner, editors, Proceedings of the 4th International Computer Science Symposium in Russia, CSR 2009, volume 5675 of Lecture Notes in Computer Science, pages 12-18. Springer, 2009. (c) Springer.
[ pdf | Abstract ]
[Tho09b] W. Thomas. Path logics with synchronization. In K. Lodaya, M. Mukund, and R. Ramanujam, editors, Perspectives in Concurrency Theory, IARCS-Universities, pages 469-481. Universities Press, 2009.
[ pdf | Abstract ]
[Tho09a] W. Thomas. Facets of synthesis: Revisiting Church's problem. In Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2009, volume 5504 of Lecture Notes in Computer Science, pages 1-14. Springer, 2009. (c) Springer.
[ pdf | Abstract ]

2008

[HTW08] F. Horn, W. Thomas, and N. Wallmeier. Optimal strategy synthesis for request-response games. In Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis, ATVA 2008, volume 5311 of Lecture Notes in Computer Science, pages 361-373. Springer, 2008. (c) Springer.
[ pdf | Abstract ]
[Tho08c] W. Thomas. Optimizing winning strategies in regular infinite games. In Proceedings of the 34th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2008, volume 4910 of Lecture Notes in Computer Science, pages 118-123. Springer, 2008. (c) Springer.
[ pdf | Abstract ]
[Tho08a] W. Thomas. Church's problem and a tour through automata theory. In A. Avron, N. Dershowitz, and A. Rabinovich, editors, Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, volume 4800. Springer, 2008.
[ pdf | Abstract ]
[Tho08d] W. Thomas. Solution of Church's problem: A tutorial. In K. Apt and R. van Rooij, editors, New Perspectives on Games and interaction, volume 4. Amsterdam University Press, 2008.
[ pdf | Abstract ]
[Tho08b] W. Thomas. Model transformations in decidability proofs for monadic theories. In M. Kaminski and S. Martini, editors, Proceedings of the 17th EACSL Annual Conference on Computer Science Logic, CLS 2008, volume 5213 of Lecture Notes in Computer Science, pages 23-31. Springer, 2008. (c) Springer.
[ pdf | Abstract ]

2007

[EFT07] H.-D. Ebbinghaus, J. Flum, and W. Thomas. Einführung in die mathematische Logik. Spektrum Akademischer Verlag, Heidelberg, fifth edition, 2007.
[RT07a] A. Rabinovich and W. Thomas. Logical refinements of Church's problem. In Proceedings of the 16th Annual Conference of the European Association for Computer Science Logic, CSL 2007, volume 4646 of Lecture Notes in Computer Science, pages 69-83. Springer, 2007. (c) Springer.
[ pdf | ps | Abstract ]
[RT07b] Frank G. Radmacher and Wolfgang Thomas. A game theoretic approach to the analysis of dynamic networks. In Proceedings of the 1st Workshop on Verification of Adaptive Systems, VerAS 2007, volume 200(2) of Electronic Notes in Theoretical Computer Science, pages 21-37, Kaiserslautern, Germany, 2007. Elsevier Science Publishers. (c) Elsevier.
[ pdf | Abstract ]
[TW07] W. Thomas and P. Weil, editors. Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2007, volume 4393 of Lecture Notes in Computer Science. Springer, 2007.
[WT07] Stefan Wöhrle and Wolfgang Thomas. Model checking synchronized products of infinite transition systems. Logical Methods in Computer Science, 3(4), 2007.
[ pdf | ps | Abstract ]

2006

[DT06] B. Durand and W. Thomas, editors. Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2006, volume 3884 of Lecture Notes in Computer Science. Springer, 2006.
[KKT06] Wong Karianto, Aloys Krieg, and Wolfgang Thomas. On intersection problems for polynomially generated sets. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006, Part II, volume 4052 of Lecture Notes in Computer Science, pages 516-527. Springer, 2006. (c) Springer.
[ pdf | ps | Abstract ]
[RT06] A. Rabinovich and W. Thomas. Decidable theories of the ordering of natural numbers with unary predicates. In Proceedings of the 15th Annual Conference of the European Association for Computer Science Logic, CSL 2006, volume 4207 of Lecture Notes in Computer Science, pages 562-574. Springer, 2006. (c) Springer.
[ pdf | Abstract ]
[SATW06] C. Schulte Althoff, W. Thomas, and N. Wallmeier. Observations on determinization of Büchi automata. Theoretical Computer Science, 363(2):224-233, October 2006.
[ pdf | ps | Abstract ]
[Tho06] W. Thomas. Automata theory and infinite transition systems. In Preproceedings of EMS Summer School CANT 2006, Prépublication 06.002, Institut de Mathématique, Université de Liège, May 2006, 2006.
[ pdf | Abstract ]

2005

[CLT05] Julien Cristau, Christof Löding, and Wolfgang Thomas. Deterministic automata on unranked trees. In Proceedings of the 15th International Symposium on Fundamentals of Computation Theory, FCT 2005, Lecture Notes in Computer Science. Springer, 2005. (c) Springer.
[ pdf | Abstract ]
[SATW05] C. Schulte Althoff, W. Thomas, and N. Wallmeier. Observations on determinization of Büchi automata. In Proceedings of the 10th International Conference on the Implementation and Application of Automata, CIAA 2005, volume 3845 of Lecture Notes in Computer Science, pages 262-272. Springer, 2005. (c) Springer.
[ pdf | ps | Abstract ]
[Tho05] W. Thomas. Some perspectives of infinite-state verification. In Proceedings of the 3rd International Symposium on Automated Technology for Verification and Analysis, ATVA 2005, volume 3707 of Lecture Notes in Computer Science, pages 3-10. Springer, 2005. (c) Springer.
[ pdf | Abstract ]

2004

[KT04] M. Kats and W. Thomas. Metaregular languages: A logical point of view. In Workshop Formale Methoden der Linguistik und 14. Theorietag Automaten und Formale Sprachen. Caputh bei Potsdam, 27. September - 30. September 2004, pages 89-93. Institut für Informatik, Universität Potsdam, 2004.
[ ps | Abstract ]
[WT04] S. Wöhrle and W. Thomas. Model checking synchronized products of infinite transition systems. In Proceedings of the 19th Annual Symposium on Logic in Computer Science (LICS), pages 2-11. IEEE Computer Society, 2004.
[ pdf | ps | Abstract ]

2003

[ATW03] J. Altenbernd, W. Thomas, and S. Wöhrle. Tiling systems over infinite pictures and their acceptance conditions. In Proceedings of the 6th International Conference on Developements in Language Theory, DLT 2002, volume 2450 of Lecture Notes in Computer Science, pages 297-306. Springer, 2003. (c) Springer.
[ pdf | ps | Abstract ]
[GRT03] Eva Giani, Philipp Rohde, and Wolfgang Thomas. A presentation and tutoring environment for courses in theoretical computer science. In Proceedings of the 5th International Conference on New Educational Environments, ICNEE 2003, pages 333-338. net4net, 2003.
[ pdf | Abstract ]
[RT03a] Philipp Rohde and Wolfgang Thomas. E-learning in theoretical computer science: Experiences from an undergraduate course. Technical Report AIB-01-2003, Annual Report 2002, Department of Computer Science, Aachen University, 2003.
[ pdf ]
[RT03b] Philipp Rohde and Wolfgang Thomas. Ein e-Lecture-System für die Theoretische Informatik. In Proceedings of the 1st e-Learning Fachtagung Informatik, DeLFI 2003, volume P-37 of Lecture Notes in Informatics, pages 17-26. Gesellschaft für Informatik, 2003.
[ pdf | Abstract ]
[Tho03a] W. Thomas. Constructing infinite graphs with a decidable MSO-theory. In Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science. Springer, 2003. Corrected version. (c) Springer.
[ ps ]
[Tho03b] W. Thomas. Uniform and nonuniform recognizability. Theoretical Computer Science, 292:299-319, 2003.
[WHT03] N. Wallmeier, P. Hütten, and W. Thomas. Symbolic synthesis of finite-state controllers for request-response specifications. In Proceedings of the 8th International Conference on the Implementation and Application of Automata, CIAA 2003, volume 2759 of Lecture Notes in Computer Science, pages 11-22. Springer, 2003. (c) Springer.
[ pdf | ps | Abstract ]

2002

[CDT02] T. Cachat, J. Duparc, and W. Thomas. Solving pushdown games with a sigma_3 winning condition. In Proceedings of the 11th Annual Conference of the European Association for Computer Science Logic, CSL 2002, volume 2471 of Lecture Notes in Computer Science, pages 322-336. Springer, 2002. (c) Springer.
[ pdf | ps | Abstract ]
[CT02] O. Carton and W. Thomas. The monadic theory of morphic infinite words and generalizations. Information and Computation, 176:51-76, 2002. Conference version [CT00].
[GTW02] E. Grädel, W. Thomas, and Th. Wilke. Automata, logics, and infinite games, volume 2500 of Lecture Notes in Computer Science. Springer, 2002.
[MST02] O. Matz, N. Schweikardt, and W. Thomas. The monadic quantifier alternation hierachy over grids and graphs. Information and Computation, 179:356-383, 2002.
[Tho02a] W. Thomas. Infinite games and verification. In Proceedings of the International Conference on Computer Aided Verification CAV'02, volume 2404 of Lecture Notes in Computer Science, pages 58-64. Springer, 2002. (c) Springer.
[ ps | Abstract ]
[Tho02b] W. Thomas. A short introduction to infinite automata. In Proceedings of the 5th international conference Developments in Language Theory, volume 2295 of Lecture Notes in Computer Science, pages 130-144. Springer, 2002. (c) Springer.
[ ps ]

2001

[Tho01] W. Thomas. Logic for computer science: The engineering challenge. In R. Wilhelm, editor, Informatics - 10 Years Back. 10 Years Ahead, volume 2000 of Lecture Notes in Computer Science, pages 257-267, Dagstuhl, 2001. Springer. (c) Springer.
[ ps ]

2000

[CT00] O. Carton and W. Thomas. The monadic theory of morphic infinite words and generalizations. In M. Nielsen and B. Rovan, editors, Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science, MFCS 2000, volume 1893 of Lecture Notes in Computer Science, pages 275-284, Bratislava, Slovakia, 2000. Springer. Journal version [CT02]. (c) Springer.
[LT00] C. Löding and W. Thomas. Alternating automata and logics over infinite words. In Proceedings of the IFIP International Conference on Theoretical Computer Science, IFIP TCS2000, volume 1872 of Lecture Notes in Computer Science, pages 521-535. Springer, 2000. (c) Springer.
[ ps | Abstract ]
[ST00] M. Steinby and W. Thomas. Trees and term rewriting in 1910: On a paper by Axel Thue. Bulletin of the European Association for Theoretical Computer Science, 72:256-269, 2000.
[ ps ]

Vor 1998

[BTV97] N. Buhrke, W. Thomas, and J. Vöge. Ein inkrementeller Ansatz zur effizienten Synthese von Controllern aus Spezifikationen mit temporaler Logik. In Formale Beschreibungstechniken für verteilte Systeme, volume 315 of GMD-Studien, pages 99-108, 1997.
[MT97] O. Matz and W. Thomas. The monadic quantifier alternation hierachy over graphs is infinite. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, pages 236-244. IEEE, 1997.
[Tho97c] W. Thomas. Elements of an automata theory over partial orders. In D.A. Peled et al., editors, Partial Order Methods in Verification, volume 29 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 25-40. American Mathematical Society, 1997.
[Tho97d] W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume III, pages 389-455. Springer, New York, 1997.
[Tho97a] W. Thomas. Automata theory on trees and partial orders. In M. Bidoit and M. Dauchet, editors, Proceedings of the 7th International Joint Conference on Theory and Practice of Software Development, TAPSOFT '97, volume 1214 of Lecture Notes in Computer Science, pages 20-38. Springer, 1997. (c) Springer.
[Tho97b] W. Thomas. Ehrenfeucht games, the composition method, and the monadic theory of ordinal words. In J. Mycielski et al., editors, Structures in Logic and Computer Science, A Selection of Essays in Honor of A. Ehrenfeucht, volume 1261 of Lecture Notes in Computer Science, pages 118-143. Springer, 1997. (c) Springer.
[ pdf ]
[EFT96] H.-D. Ebbinghaus, J. Flum, and W. Thomas. Einführung in die Mathematische Logik. Spektrum Akademischer Verlag, Heidelberg, fourth edition, 1996.
[GRST96] D. Giammarresi, A. Restivo, S. Seibert, and W. Thomas. Monadic second-order logic over rectangular pictures and recognizability by tiling systems. Information and Computation, 125(1):32-45, 1996.
[ST96] I. Schiering and W. Thomas. Counter-free automata, first-order logic, and star-free expressions extended by prefix oracles. In J. Dassow, G. Rozenberg, and A. Salomaa, editors, Proceedings of the 2nd International Conference on Developments in Language Theory, DLT '95, pages 166-175, Magdeburg, Germany, 1996. World Scientific.
[Tho96] W. Thomas. Languages, automata and logic. Technical Report 9607, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Germany, May 1996.
[ ps ]
[MMP+95] O. Matz, A. Miller, A. Potthoff, W. Thomas, and E. Valkema. Report on the programm amore. Technical Report 9507, Christian-Albrechts-Universiät Kiel, 1995.
[STT95b] H. Straubing, D. Thérien, and W. Thomas. Regular languages defined with generalized quantifiers. Information and Computation, 118:289-301, 1995.
[STT95a] H. Straubing, D. Thérien, and W. Thomas. Logics for regular languages, finite monoids, and circuit complexity. In J.B. Fountain, editor, Proceedings of the NATO Advanced Seminar on Semigroups, Formal Languages, and Groups, volume 466 of NATO ASI Series C, pages 119-146, York, 1995. Kluwer, Dordrecht.
[Tho95a] W. Thomas. On the synthesis of strategies in infinite games. In E.W. Mayr and C. Puech, editors, Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science, STACS '95, volume 900 of Lecture Notes in Computer Science, pages 1-13. Springer, Berlin, 1995. (c) Springer.
[ ps ]
[Tho95b] W. Thomas. Theoretical Computer Science - Some Subjective Impressions, Talk at ASMICS-Workshop, Evreux, October 1995. http://www.informatik.uni-kiel.de/~wt/#TCS.
[EFT94] H.-D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical logic. Springer, New York, second edition, 1994.
[GRST94] D. Giammarresi, A. Restivo, S. Seibert, and W. Thomas. Monadic second-order logic over rectangular pictures and recognizability by tiling systems. In P. Enjalbert, E.W. Mayr, and K.W. Wagner, editors, Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science, STACS '94, volume 775 of Lecture Notes in Computer Science, pages 365-375. Springer, 1994. (c) Springer.
[JPT94] E. Jurvanen, A. Potthoff, and W. Thomas. Deterministic tree languages recognizable by regular frontier check. In G. Rozenberg and A. Salomaa, editors, Proceedings of the 1st International Conference on Developments in Language Theory, DLT '93, pages 3-17, Turku, Finland, 1994. World Scientific.
[PST94] A. Potthoff, S. Seibert, and W. Thomas. Nondeterminism versus determinism of finite automata over directed acyclic graphs. Bulletin of the Belgian Mathematical Society - Simon Stevin, 1(2):285-298, 1994.
[Tho94a] W. Thomas. Finite-state recognizability and logic: From words to graphs. In B. Pehrson and I. Simon, editors, Proceedings of the IFIP 13th World Computer Congress: Technology and Foundations - Information Processing '94, volume 1, pages 499-506, Hamburg, 1994. North-Holland, Amsterdam.
[Tho94b] W. Thomas. Finite-state strategies in regular infinite games. In P.S. Thiagarajan, editor, Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS '94, volume 880 of Lecture Notes in Computer Science, pages 149-158. Springer, 1994. (c) Springer.
[Tho94c] W. Thomas. Theoretische Grundlagen der Informatik. Drei Vorträge zur Lehrerfortbildung. Technical report, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Germany, 1994.
[TL94] W. Thomas and H. Lescow. Logical specifications of infinite computations. In J.W. de Bakker, W.P. de Roever, and G. Rozenberg, editors, REX School/Symposium 1993: A Decade of Concurrency, volume 803 of Lecture Notes in Computer Science, pages 583-621, Noordwijkerhout, The Netherlands, 1994. Springer. (c) Springer.
[JPT93] E. Jurvanen, A. Potthoff, and W. Thomas. Deterministic tree languages recognizable by regular frontier check. Bericht 9311, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Germany, 1993.
[PT93] A. Potthoff and W. Thomas. Regular tree languages without unary symbols are star-free. In Z. Esik, editor, Proceedings of the 9th International Conference on Fundamentals of Computation Theory, FCT '93, volume 710 of Lecture Notes in Computer Science, pages 396-405. Springer, Berlin, 1993. (c) Springer.
[Tho93] W. Thomas. On the Ehrenfeucht-Fraïssé game in theoretical computer science. In M.C. Gaudel and J.P. Jouannaud, editors, Proceedings of the International Joint Conference on Theory and Practice of Software Development, TAPSOFT '93, volume 668 of Lecture Notes in Computer Science, pages 559-568, Orsay, France, 1993. Springer. (c) Springer.
[EFT92] H.-D. Ebbinghaus, J. Flum, and W. Thomas. Einführung in die mathematische Logik. BI Wissenschaftsverlag, Mannheim, third edition, 1992.
[Tho92c] W. Thomas. Infinite trees and automaton definable relations over omega-words. Theoretical Computer Science, 103(1):143-159, 1992.
[Tho92b] W. Thomas. Finite-state recognizability of graph properties. In D. Krob, editor, Théorie des Automates et Applications, volume 176 of Publications de l'Université de Rouen, pages 147-159, 1992.
[Tho92a] W. Thomas. 2. Theorietag ``Automaten und Formale Sprachen'' (proceedings). Report 9220, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Germany, 1992.
[Tho92d] W. Thomas. Proceedings of the ASMICS-Workshop ``Logics and Recognizable Sets'', Dersau, October 8-10, 1990. Bericht 9104, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Germany, 1992.
[Tho91b] W. Thomas. On logics, tilings, and automata. In J. Leach Albert, B. Monien, and M. Rodríguez-Artalejo, editors, Proceedings of the 18th International Colloquium on Automata, Languages and Programming, ICALP '91, volume 510 of Lecture Notes in Computer Science, pages 441-454, Madrid, Spain, 1991. Springer, Berlin. (c) Springer.
[Tho91a] W. Thomas. Neue Aspekte in Rabins Theorie der Baumautomaten. Bericht 9110, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Germany, 1991.
[JPTW90] V. Jansen, A. Potthoff, W. Thomas, and U. Wermuth. A Short Guide to the AMORE System (computing Automata, MOnoids, and Regular Expressions). Technical Report AIB-90-2, RWTH Aachen, 1990.
[Tho90a] W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 133-192. Elsevier Science Publishers, Amsterdam, 1990.
[Tho90b] W. Thomas. Infinite trees and automaton definable relations over omega-words. In C. Choffrut and T. Lengauer, editors, Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science, STACS '90, volume 415 of Lecture Notes in Computer Science, pages 263-277, Rouen, France, 1990. Springer. (c) Springer.
[Tho90c] W. Thomas. Logical definability of trace languages. In V. Diekert, editor, Proceedings of the ASMICS-Workshop ``Free Partially Commutative Monoids'', Rep. TUM-I9002, pages 172-182. TU München, 1990.
[KMP+89] V. Kell, A. Maier, A. Potthoff, W. Thomas, and U. Wermuth. AMORE: A system for computing Automata, MOnoids and Regular Expressions. In B. Monien and R. Cori, editors, Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science, STACS '89, volume 349 of Lecture Notes in Computer Science, pages 537-538, Paderborn, Germany, 1989. Springer. (c) Springer.
[Tho89] W. Thomas. Computation tree logic and regular omega-languages. In J.W. de Bakker, W.P. de Roever, and G. Rozenberg, editors, REX Workshop 1988: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 690-713, Noordwijkerhout, The Netherlands, 1989. Springer. (c) Springer.
[STT88] H. Straubing, D. Thérien, and W. Thomas. Regular languages defined with generalized quantifiers. In T. Lepistö and A. Salomaa, editors, Proceedings of the 15th International Colloquium on Automata, Languages and Programming, ICALP '88, volume 317 of Lecture Notes in Computer Science, pages 561-575, Tampere, Finland, 1988. Springer. (c) Springer.
[Tho88] W. Thomas. Automata on infinite objects. Technical Report AIB-88-17, RWTH Aachen, 1988.
[ pdf ]
[HT87] T. Hafer and W. Thomas. Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree. In T. Ottmann, editor, Proceedings of the 14th International Colloquium on Automata, Languages and Programming, ICALP '87, volume 267 of Lecture Notes in Computer Science, pages 269-279, Karlsruhe, Germany, 1987. Springer. (c) Springer.
[Tho87b] W. Thomas. On chain logic, path logic, and first-order logic over infinite trees. In Proceedings of the 2nd Annual IEEE Symposium on Logic in Computer Science, LICS '87, pages 245-256, Ithaca, N.Y., 1987. IEEE Computer Society Press.
[Tho87a] W. Thomas. A concatenation game and the dot-depth hierarchy. In E. Börger, editor, Computation Theory and Logic, volume 270 of Lecture Notes in Computer Science, pages 415-426. Springer, Berlin, 1987.
[Tho86] W. Thomas. On frontiers of regular trees. RAIRO Theoretical Informatics and Applications, 20:371-381, 1986.
[Tho84a] W. Thomas. An application of the Ehrenfeucht-Fraïssé game in formal language theory. Bull. Soc. Math. France, Mem., 16:11-21, 1984.
[Tho84b] W. Thomas. Logical aspects in the study of tree languages. In B. Courcelle, editor, Proceedings of the 9th International Colloquium on Trees in Algebra and Programming, CAAP '84, pages 31-50. Cambridge University Press, Cambridge, 1984.
[Tho82a] W. Thomas. Classifying regular events in symbolic logic. Journal of Computer and System Sciences, 25(3):360-376, 1982.
[Tho82b] W. Thomas. A hierarchy of sets of infinite trees. In A.B. Cremers and H.P. Kriegel, editors, Proceedings of the 6th GI-Conference on Theoretical Computer Science, volume 145 of Lecture Notes in Computer Science, pages 335-342, Dortmund, Germany, 1982. Springer, Berlin.
[Tho81b] W. Thomas. Remark on the star-height-problem. Theoretical Computer Science, 13:231-237, 1981.
[Tho81a] W. Thomas. A combinatorial approach to the theory of omega-automata. Information and Control, 48(3):261-283, 1981.
[Tho80] W. Thomas. On the bounded monadic theory of well-ordered structures. Journal of Symbolic Logic, 45:334-338, 1980.
[Tho79] W. Thomas. Star-free regular sets of omega-sequences. Information and Control, 42(2):148-156, 1979.