Publikationen

Nach Autoren

Mitarbeiter

Frühere Mitarbeiter

Nach Erscheinungsjahr

To appear

[CG14a] Namit Chaturvedi and Marcus Gelderie. Classifying regular infinitary trace langauges using word automata. In MFCS 2014: 39th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, 2014. To appear.
[ Abstract ]
[CKLV13] T. Colcombet, D. Kuperberg, C. Löding, and M. Vanden Boom. Deciding the weak definability of Büchi definable tree languages. In Proceedings of the 22nd Annual Conference of the European Association for Computer Science Logic, CSL 2013, Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. to appear. (c) Springer.
[ pdf | Abstract ]

2014

[Cha14b] Namit Chaturvedi. Toward a structure theory of regular infinitary trace languages. In ICALP 2014: 41st International Colloquium on Automata, Languages, and Programming, Part II, number 8573 in Lecture Notes in Computer Science, pages 134-145, 2014.
[ pdf | Abstract ]
[Cha14a] Namit Chaturvedi. Languages of infinite traces and deterministic asynchronous automata. Technical Report AIB-2014-04, RWTH Aachen, February 2014. Revised version.
[ pdf | http | Abstract ]
[CG14b] Namit Chaturvedi and Marcus Gelderie. Weak omega-Regular Trace Languages. arXiv.org, Feb 2014. CoRR abs/1402.3199.
[ pdf | http | Abstract ]
[Fel14] Ingo Felscher. Model composition in model-checking. PhD thesis, RWTH Aachen, 2014.
[ pdf | http | Abstract ]

2013

[Brü13] Benedikt Brütsch. Synthesizing structured reactive programs via deterministic tree automata. In Fabio Mogavero, Aniello Murano, and Moshe Y. Vardi, editors, Proceedings 1st International Workshop on Strategic Reasoning, volume 112 of Electronic Proceedings in Theoretical Computer Science, pages 107-113. Open Publishing Association, 2013.
[ pdf | http | Abstract ]
[Fri13] W. Fridman. A study of pushdown games. PhD thesis, RWTH Aachen, 2013.
[ pdf | http | Abstract ]
[GLMN13b] Pranav Garg, Christof Löding, P. Madhusudan, and Daniel Neider. Learning universally quantified invariants of linear data structures. In Computer Aided Verification - 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings, volume 8044 of Lecture Notes in Computer Science, pages 813-829. Springer, 2013.
[ pdf | Abstract ]
[GLMN13a] Pranav Garg, Christof Löding, P. Madhusudan, and Daniel Neider. ICE: A Robust Learning Framework for Synthesizing Invariants. Technical report, RWTH Aachen University and University of Illinois at Urbana-Champaign, 2013.
[ pdf | Abstract ]
[Gel13] Marcus Gelderie. Strategy composition in compositional games. In Fedor V. Fomin, Rusins Freivalds, Marta Kwiatkowska, and David Peleg, editors, Automata, Languages and Programming, Lecture Notes in Computer Science, 2013.
[ pdf | http ]
[LL13] Martin Lang and Christof Löding. Modeling and verification of infinite systems with resources. Logical Methods in Computer Science, 9(4), 2013.
[ pdf | Abstract ]
[LR13] Christof Löding and Stefan Repke. Decidability Results on the Existence of Lookahead Delegators for NFA. In Anil Seth and Nisheeth K. Vishnoi, editors, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), volume 24 of Leibniz International Proceedings in Informatics (LIPIcs), pages 327-338, Dagstuhl, Germany, 2013. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
[ pdf | http | Abstract ]
[NJ13] Daniel Neider and Nils Jansen. Regular Model Checking Using Solver Technologies and Automata Learning. In Proceedings of the 5th International NASA Formal Methods Symposium (NFM 2013), volume 7871 of Lecture Notes in Computer Science, pages 16-31. Springer, 2013.
[ pdf | Abstract ]
[Zim13] M. Zimmermann. Optimal Bounds in Parametric LTL Games. Theoretical Computer Science, 493:30-45, 2013. Journal version of [Zim11]. (c) Elsevier.
[ pdf | ps | Abstract ]

2012

[BLO12] Stefan Breuers, Christof Löding, and Jörg Olschewski. Improved Ramsey-based Büchi complementation. In FoSSaCS 2012, volume 7213 of Lecture Notes in Computer Science, pages 150-164. Springer, 2012. (c) Springer.
[ Abstract ]
[CMDC12] N. Chaturvedi, B. Meenakshi, and A. Datta Chowdhury. A framework for decentralized access control using finite state automata. In Deepak D'Souza and Priti Shankar, editors, Modern Applications of Automata Theory, volume 2 of IISc Research Monographs Series, pages 171-191. World Scientific, May 2012.
[ http | Abstract ]
[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 ]
[FZ12a] J. Fearnley and M. Zimmermann. Playing Muller Games in a Hurry. International Journal of Foundations of Computer Science, 23:649-668, 2012. Journal version of [FZ10]. International Journal of Foundations of Computer Science (c) 2012 World Scientific Publishing Company.
[ pdf | ps | Abstract ]
[Fel12] I. Felscher. LTL-Model-Checking via Model Composition. In Alain Finkel, Jerome Leroux, and Igor Potapov, editors, Reachability Problems, 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings, volume 7550 of Lecture Notes in Computer Science, pages 42-53. Springer, 2012.
[ pdf | http | Abstract ]
[FZ12b] W. Fridman and M. Zimmermann. Playing Pushdown Parity Games in a Hurry. In M. Faella and A. Murano, editors, Proceedings of the Third International Symposium on Games, Automata, Logic, and Formal Verification, GandALF 2012, volume 96 of Electronic Proceedings in Theoretical Computer Science, pages 183-196, 2012.
[ pdf | ps | Abstract ]
[Gel12a] M. Gelderie. Strategy machines and their complexity (with addendum). Technical Report AIB-2012-04, RWTH-Aachen, 2012.
[ pdf ]
[Gel12b] Marcus Gelderie. Strategy machines and their complexity (with addendum). In Branislav Rovan, Vladimiro Sassone, and Peter Widmayer, editors, Mathematical Foundations of Computer Science 2012, volume 7464 of Lecture Notes in Computer Science, pages 431-442. Springer Berlin / Heidelberg, 2012. 10.1007/978-3-642-32589-2_39.
[ pdf | http ]
[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 ]
[IL12] Dimitri Isaak and Christof Löding. Efficient inclusion testing for simple classes of unambiguous omega-automata. Information Processing Letters, 112(14-15):578-582, 2012.
[ pdf | http | Abstract ]
[LN12] Martin Leucker and Daniel Neider. Learning Minimal Deterministic Automata from Inexperienced Teachers. In Proceedings of the 5th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (ISoLA 2012), volume 7609 of Lecture Notes in Computer Science, pages 524-538. Springer, 2012.
[ pdf | Abstract ]
[Löd12] C. Löding. Basics on tree automata. In Deepak D'Souza and Priti Shankar, editors, Modern Applications of Automata Theory. World Scientific, 2012.
[LR12] Christof Löding and Stefan Repke. Regularity Problems for Weak Pushdown omega-Automata and Games. In Branislav Rovan, Vladimiro Sassone, and Peter Widmayer, editors, Mathematical Foundations of Computer Science 2012, volume 7464 of Lecture Notes in Computer Science, pages 764-776. Springer Berlin / Heidelberg, 2012. 10.1007/978-3-642-32589-2_66.
[ pdf | http | Abstract ]
[Nei12] Daniel Neider. Computing Minimal Separating DFAs and Regular Invariants Using SAT and SMT Solvers. In Proceedings of the 10th International Symposium on Automated Technology for Verification and Analysis (ATVA 2012), volume 7561 of Lecture Notes in Computer Science, pages 354-369. Springer, 2012.
[ pdf | Abstract ]
[NRZ12] D. Neider, R. Rabinovich, and M. Zimmermann. Down the Borel Hierarchy: Solving Muller Games via Safety Games. In M. Faella and A. Murano, editors, Proceedings of the Third International Symposium on Games, Automata, Logic, and Formal Verification, GandALF 2012, volume 96 of Electronic Proceedings in Theoretical Computer Science, pages 169-182, 2012.
[ pdf | ps | Abstract ]
[Rad12] Frank G. Radmacher. Games on dynamic networks: Routing and connectivity. PhD thesis, RWTH Aachen, 2012.
[ pdf | Abstract ]
[Sla12] Michaela Slaats. Infinite regular games in the higher-order pushdown and the parametrized setting. PhD thesis, RWTH Aachen, 2012.
[ pdf | http | Abstract ]
[WGLW12] E. Weingaertner, R. Glebke, M. Lang, and K. Wehrle. Building a modular bittorrent model for ns-3. In Proceedings of the 2012 workshop on ns-3 (WNS3 2012), 3 2012.
[ Abstract ]
[Zim12] M. Zimmermann. Solving Infinite Games with Bounds. PhD thesis, RWTH Aachen University, 2012.
[ pdf | Abstract ]

2011

[BMOU11] Patricia Bouyer, Nicolas Markey, Jörg Olschewski, and Michael Ummels. Measuring permissiveness in parity games: Mean-payoff parity games revisited. In Automated Technology for Verification and Analysis, volume 6996 of Lecture Notes in Computer Science, pages 135-149. Springer, 2011. (c) Springer.
[ Abstract ]
[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 ]
[FLZ11] W. Fridman, C. Löding, and M. Zimmermann. Degrees of Lookahead in Context-free Infinite Games. In Marc Bezem, editor, Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL, volume 12 of Leibniz International Proceedings in Informatics (LIPIcs), pages 264-276, Dagstuhl, Germany, 2011. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
[ pdf | ps | http | Abstract ]
[FP11] W. Fridman and B. Puchala. Distributed Synthesis for Regular and Contextfree Specifications. In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011, Lecture Notes in Computer Science. Springer, 2011.
[ pdf | Abstract ]
[Gel11a] M. Gelderie. Classifying regular languages via cascade products of automata. Diploma Thesis (revised version), RWTH Aachen, 2011.
[ pdf ]
[Gel11b] Marcus Gelderie. Classifying regular languages via cascade products of automata. In Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, editors, Language and Automata Theory and Applications, volume 6638 of Lecture Notes in Computer Science, pages 286-297. Springer Berlin / Heidelberg, 2011. The original publication is available at www.springerlink.com.
[ pdf | http ]
[GH11] Marcus Gelderie and Michael Holtmann. Memory reduction via delayed simulation. In Johannes Reich and Bernd Finkbeiner, editors, Proceedings International Workshop on Interactions, Games and Protocols Saarbrücken, Germany, 27th March 2011, volume 50 of Electronic Proceedings in Theoretical Computer Science, pages 46-60. Open Publishing Association, February 2011.
[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 ]
[Hol11] Michael Holtmann. Memory and delay in regular infinite games. PhD thesis, RWTH Aachen, 2011.
[ pdf | http | Abstract ]
[Lan11] M. Lang. Resource-bounded Reachability on Pushdown Systems. Master thesis, RWTH Aachen, 2011.
[ pdf | Abstract ]
[Löd11] C. Löding. Infinite games and automata theory. In Krzysztof R. Apt and Erich Grädel, editors, Lectures in Game Theory for Computer Scientists. Cambridge University Press, 2011.
[Nei11] Daniel Neider. Small Strategies for Safety Games. In Proceedings of the 9th Symposium on Automated Technology for Verification and Analysis (ATVA 2011), volume 6996 of Lecture Notes in Computer Science, pages 306-320. Springer, 2011.
[ pdf | Abstract ]
[NRZ11] D. Neider, R. Rabinovich, and M. Zimmermann. Solving Muller Games via Safety Games. Technical Report AIB-2011-14, RWTH Aachen, 2011.
[ pdf | ps | 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 ]
[Zim11] M. Zimmermann. Optimal Bounds in Parametric LTL Games. In G. D'Agostino and S. La Torre, editors, Proceedings of the Second International Symposium on Games, Automata, Logic, and Formal Verification, GandALF 2011, volume 54 of Electronic Proceedings in Theoretical Computer Science, pages 146-161, 2011. Note: the proof of Theorem 10 contains an error. The journal version [Zim13] presents a 3EXPTIME algorithm for the optimization problems. See also Chapter 3 of my PhD thesis [Zim12].
[ pdf | ps | Abstract ]

2010

[Alt10] J. Altenbernd. Reachability over word rewriting systems. PhD thesis, RWTH Aachen, 2010.
[ pdf | http | Abstract ]
[BKK+10] Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker, Daniel Neider, and David R. Piegdon. libalf: The Automata Learning Framework. In Proceedings of the 22nd International Conference on Computer Aided Verification (CAV 2010), volume 6174 of Lecture Notes in Computer Science, pages 360-364. Springer, 2010.
[ pdf | Abstract ]
[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 ]
[BL10] Nicolas Bousquet and Christof Löding. Equivalence and inclusion problem for strongly unambiguous Büchi automata. In 4th International Conference on Language and Automata Theory and Applications, LATA 2010, volume 6031 of Lecture Notes in Computer Science, pages 118-129. Springer, 2010. (c) Springer.
[ pdf | Abstract ]
[CLNW10] A. Carayol, C. Löding, D. Niwinski, and I. Walukiewicz. Choice functions and well-orderings over the infinite binary tree. Central European Journal of Mathematics, 8(4):662-682, 2010. Extended version of [CL07a].
[ pdf | Abstract ]
[CHL10] K. Chatterjee, F. Horn, and C. Löding. Obliging games. In 21st International Conference on Concurrency Theory, CONCUR 2010, volume 6269 of Lecture Notes in Computer Science, pages 284-296. Springer, 2010.
[ pdf | Abstract ]
[CL10] T. Colcombet and C. Löding. Regular cost functions over finite trees. In Twenty-Fifth Annual IEEE Symposium on Logic in Computer Science, LICS 2010, pages 70-79. IEEE Computer Society, 2010.
[ pdf | Abstract ]
[FZ10] J. Fearnley and M. Zimmermann. Playing Muller Games in a Hurry. In A. Montanari, M. Napoli, and M. Parente, editors, Proceedings of the First International Symposium on Games, Automata, Logic, and Formal Verification, GandALF 2010, volume 25 of Electronic Proceedings in Theoretical Computer Science, pages 146-161, 2010. Conference version of [FZ12a].
[ pdf | ps | Abstract ]
[Fri10] W. Fridman. Formats of Winning Strategies for Six Types of Pushdown Games. In A. Montanari, M. Napoli, and M. Parente, editors, Proceedings of the First Symposium on Games, Automata, Logic, and Formal Verification, GandALF 2010, volume 25. Electronic Proceedings in Theoretical Computer Science, 2010.
[ pdf | ps | Abstract ]
[FLZ10] W. Fridman, C. Löding, and M. Zimmermann. Degrees of Lookahead in Context-free Infinite Games. Technical Report AIB-2010-20, RWTH Aachen, December 2010.
[ pdf | ps | 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 ]
[Nei10] Daniel Neider. Reachability Games on Automatic Graphs. In Proceedings of the 15th International Conference on Implementation and Application of Automata (CIAA 2010), volume 6482 of Lecture Notes in Computer Science, pages 222-230. Springer, 2010.
[ pdf | Abstract ]
[NL10] Daniel Neider and Christof Löding. Learning Visibly One-Counter Automata in Polynomial Time. Technical Report AIB-2010-02, RWTH Aachen, January 2010.
[ pdf | ps | Abstract ]
[OU10] Jörg Olschewski and Michael Ummels. The complexity of finding reset words in finite automata. In Mathematical Foundations of Computer Science 2010, volume 6281 of Lecture Notes in Computer Science, pages 568-579. Springer, 2010. (c) Springer.
[ pdf | Abstract ]
[Sch10] Stefan Schulz. First-Order Logic with Reachability Predicates on Infinite Systems. In Kamal Lodaya and Meena Mahajan, editors, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), volume 8 of Leibniz International Proceedings in Informatics (LIPIcs), pages 493-504, Dagstuhl, Germany, 2010. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
[ pdf | http | Abstract ]
[SLW+10] André Stollenwerk, Martin Lang, Marian Walter, Jutta Arens, Rüdger Kopp, and Stefan Kowalewski. Sicherheitskonzept für eine intensivmedizinische Anwendung am Beispiel der ECMO. In Entwurf komplexer Automatisierungssysteme (EKA 2010), volume 11, pages 65-74, May 2010.
[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.
[Won10] Karianto Wong. Finite automata on unranked trees: Extensions by arithmetical and equality constraints. PhD thesis, RWTH Aachen, 2010.
[ pdf | http | Abstract ]
[Zim10] M. Zimmermann. Parametric LTL Games. Technical Report AIB-2010-11, RWTH Aachen, 2010.
[ pdf | ps | Abstract ]

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 ]
[Lan09] M. Lang. Entwicklung eines dezentral implementierten Sicherheitskonzeptes für intensivmedizinische Anwendungen. Bachelor Thesis, RWTH Aachen, 2009.
[ pdf | Abstract ]
[Löd09] Christof Löding. Logic and automata over infinite trees. Habilitation Thesis, RWTH Aachen, Germany, 2009.
[ pdf ]
[LW09] Christof Löding and Karianto Wong. On nondeterministic unranked tree automata with sibling constraints. In Ravi Kannan and K. Narayan Kumar, editors, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009), volume 4 of Leibniz International Proceedings in Informatics (LIPIcs), pages 311-322, Dagstuhl, Germany, 2009. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[ pdf | http | Abstract ]
[Sch09] Stefan Schulz. First-Order Logic with Reachability Predicates over Infinite Systems. Diploma thesis, RWTH-Aachen, 2009.
[ 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 ]
[Zim09a] M. Zimmermann. Time-optimal Winning Strategies for Poset Games. In S. Maneth, editor, Proceedings of the 14th International Conference on Implementation and Application of Automata, CIAA 2009, volume 5642 of Lecture Notes in Computer Science, pages 217-226. Springer, 2009. Note: this document slightly differs from the printed version because an error in Corollary 1 has been corrected. (c) Springer.
[ pdf | ps | Abstract ]
[Zim09b] M. Zimmermann. Time-optimal Winning Strategies for Poset Games. Technical Report AIB-2009-13, RWTH Aachen, May 2009. Full version of [Zim09a]. Note: this document slightly differs from the original because an error in Corollary 1 has been corrected.
[ pdf | ps | Abstract ]
[Zim09c] M. Zimmermann. Time-optimal Winning Strategies in Infinite Games. Diplomarbeit, RWTH Aachen, 2009.
[ pdf | Abstract ]

2008

[Alt08] J. Altenbernd. On bifix systems and generalizations. In Proceedings of the 2nd International Conference on Language and Automata Theory and Applications, LATA 2008, volume 5196 of Lecture Notes in Computer Science, pages 40-51. Springer, 2008. (c) Springer.
[ pdf | Abstract ]
[CS08] A. Carayol and M. Slaats. Positional Strategies for Higher-Order Pushdown Parity Games. In Mathematical Foundations of Computer Science 2008, volume 5162 of Lecture Notes in Computer Science, pages 217-228. Springer, 2008. (c) Springer.
[ pdf | Abstract ]
[CL08b] T. Colcombet and C. Löding. The non-deterministic Mostowski hierarchy and distance-parity automata. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, volume 5126 of Lecture Notes in Computer Science, pages 398-409. Springer, 2008. (c) Springer.
[ pdf | Abstract ]
[CL08a] T. Colcombet and C. Löding. The nesting-depth of disjunctive mu-calculus for tree languages and the limitedness problem. In Proceedings of the 17th EACSL Annual Conference on Computer Science Logic CSL 2008, volume 5213 of Lecture Notes in Computer Science. Springer, 2008. (c) Springer.
[ pdf | Abstract ]
[Fel08] I. Felscher. The Compositional Method and Regular Reachability. In Proceedings of the 2nd Workshop on Reachability Problems, Liverpool, UK, September 15-17,2008, volume 223 of Electronic Notes in Theoretical Computer Science, pages 103-117. Elsevier Science Publishers, 2008.
[ pdf | http | Abstract ]
[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 ]
[Nei08] Daniel Neider. Lernverfahren für Automaten über linearisierten XML-Dokumenten. In Informatik Spektrum. Springer, 2008. (c) Springer.
[ pdf | Abstract ]
[Rad08a] Frank G. Radmacher. An automata theoretic approach to rational tree relations. In Proceedings of the 34th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2008, volume 4910 of Lecture Notes in Computer Science, pages 424-435. Springer, 2008. (c) Springer.
[ pdf | Abstract ]
[Rad08b] Frank G. Radmacher. An automata theoretic approach to the theory of rational tree relations. Technical Report AIB-2008-05, RWTH Aachen, March 2008. Full version of [Rad08a].
[ pdf | ps | 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 ]
[Wal08] Nico Wallmeier. Strategien in unendlichen Spielen mit Liveness-Gewinnbedingungen : Syntheseverfahren, Optimierung und Implementierung. PhD thesis, RWTH Aachen, 2008.
[ pdf | http | Abstract ]

2007

[BCL07] A. Blumensath, T. Colcombet, and C. Löding. Logical theories and compatible operations. In J. Flum, E. Grädel, and T. Wilke, editors, Logic and automata: History and Perspectives, pages 72-106. Amsterdam University Press, 2007. Note: This version slightly differs from the printed version because an error in Theorem 3.19 has been corrected.
[ pdf ]
[CL07a] Arnaud Carayol and Christof Löding. MSO on the infinite binary tree: Choice and order. 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 161-176. Springer, 2007. (c) Springer.
[ pdf | Abstract ]
[CL07b] T. Colcombet and C. Löding. Transforming structures by set interpretations. Logical Methods in Computer Science, 3(2), 2007.
[ pdf | Abstract ]
[EFT07] H.-D. Ebbinghaus, J. Flum, and W. Thomas. Einführung in die mathematische Logik. Spektrum Akademischer Verlag, Heidelberg, fifth edition, 2007.
[Hol07] M. Holtmann. Memory Reduction for Strategies in Infinite Games. Diploma Thesis (revised version), RWTH Aachen, 2007.
[ pdf | ps | Abstract ]
[HL07] Michael Holtmann and Christof Löding. Memory Reduction for Strategies in Infinite Games. In Jan Holub and Jan Zdárek, editors, Implementation and Application of Automata, 12th International Conference, CIAA 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers, volume 4783 of Lecture Notes in Computer Science, pages 253-264. Springer, 2007.
[ pdf | ps | Abstract ]
[KL07] Wong Karianto and Christof Löding. Unranked tree automata with sibling equalities and disequalities. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming, ICALP 2007, volume 4596 of Lecture Notes in Computer Science, pages 875-887. Springer, 2007. (c) Springer.
[ pdf | Abstract ]
[LLS07] Christof Löding, Carsten Lutz, and Olivier Serre. Propositional dynamic logic with recursive programs. Journal of Logic and Algebraic Programming, 73:51-69, 2007. Full version of [LS06].
[ pdf | Abstract ]
[LS07] Christof Löding and Alex Spelten. Transition Graphs of Rewriting Systems over Unranked Trees. In Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, volume 4708 of Lecture Notes in Computer Science, pages 67-77. Springer, 2007. Full version (with appendix). A preliminary version is accepted at the international conference AutoMathA 2007, Automata: from Mathematics to Applications, Palermo, Italy. (c) Springer.
[ pdf | ps | Abstract ]
[Nei07] D. Neider. Learning Automata for Streaming XML Documents. Diploma thesis, RWTH Aachen, 2007.
[ pdf | ps ]
[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 ]
[Rad07] Frank G. Radmacher. Automatendefinierbare Relationen über Bäumen. Diploma thesis (revised version), RWTH Aachen, 2007.
[ pdf | 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 ]
[Sla07] M. Slaats. Infinite games over higher-order pushdown systems. Diplomarbeit, RWTH Aachen, 2007.
[ pdf | ps | 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

[BLS06] Vince Bárány, Christof Löding, and Olivier Serre. Regularity problems for visibly pushdown languages. In Proceedings of the 23rd Annual Symposioum on Theoretical Aspects of Computer Science, STACS 2006, volume 3884 of Lecture Notes in Computer Science, pages 420-431. Springer, 2006. (c) Springer.
[ pdf | ps | Abstract ]
[BKL+06] M. Benedikt, B. Kuijpers, C. Löding, J. Van den Bussche, and Th. Wilke. A characterization of first-order topological properties of planar spatial data. Journal of the ACM, 53(2):273-305, 2006. Full version of [BLVdBW04].
[ pdf | Abstract ]
[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 ]
[KL06] Wong Karianto and Christof Löding. Unranked tree automata with sibling equalities and disequalities. Technical Report AIB-2006-13, RWTH Aachen, October 2006.
[ pdf | ps | Abstract ]
[Löd06] Christof Löding. Reachability problems on regular ground tree rewriting graphs. Theory of Computing Systems, 39(2):347-383, 2006.
[ pdf | Abstract ]
[LS06] Christof Löding and Olivier Serre. Propositional dynamic logic with recursive programs. volume 3921 of Lecture Notes in Computer Science, pages 292-306. Springer, 2006. (c) Springer.
[ pdf | 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 ]
[Roh06b] Philipp Rohde. On the mu-calculus augmented with sabotage. In Proceedings of the 9th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2006, volume 3921 of Lecture Notes in Computer Science, pages 142-156. Springer, 2006. (c) Springer.
[ pdf | Abstract ]
[Roh06a] Philipp Rohde. On games and logics over dynamically changing structures. PhD thesis, RWTH Aachen, 2006.
[ 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 ]
[Spe06] A. Spelten. Rewriting Systems over Unranked Trees. Diplomarbeit, RWTH Aachen, 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 ]
[Kar05a] Wong Karianto. Adding monotonic counters to automata and transition graphs. In Proceedings of the 9th International Conference on Developments in Language Theory, DLT 2005, volume 3572 of Lecture Notes in Computer Science, pages 308-319. Springer, 2005. (c) Springer.
[ pdf | ps | Abstract ]
[Kar05b] Wong Karianto. On Parikh images of higher-order pushdown automata. In 15. Theorietag der GI Fachgruppe 0.1.5 Automaten und Formale Sprachen, Technical Report WSI-2005-16, pages 26-29. Wilhelm-Schickard-Institut für Informatik, Eberhard-Karls-Universität Tübingen, 2005.
[ pdf | ps | 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 ]
[Wöh05] S. Wöhrle. Decision problems over infinite graphs: Higher-order pushdown systems and synchronized products. PhD thesis, RWTH Aachen, 2005.
[ pdf | ps | Abstract ]

2004

[BLVdBW04] M. Benedikt, C. Löding, J. Van den Bussche, and Th. Wilke. A characterization of first-order topological properties of planar spatial data. In Proceedings of the 23rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2004, pages 107-114. ACM Press, 2004.
[ pdf | Abstract ]
[BSL04] Yves Bontemps, Pierre Yves Schobbens, and Christof Löding. Synthesis of open reactive systems from scenario-based specifications. Fundamenta Informaticae, 62(2):139-169, 2004.
[ ps | Abstract ]
[CL04] Th. Colcombet and C. Löding. On the expressiveness of deterministic transducers over infinite trees. In Proceedings of the 21st Annual Symposioum on Theoretical Aspects of Computer Science, STACS 2004, volume 2996 of Lecture Notes in Computer Science, pages 428-439. Springer, 2004. (c) Springer.
[ pdf | ps | Abstract ]
[GW04] M. Grohe and S. Wöhrle. An existential locality theorem. Annals of Pure and Applied Logic, 129:131-148, 2004.
[ Abstract ]
[Kar04] Wong Karianto. Parikh automata with pushdown stack. Diplomarbeit, RWTH Aachen, 2004.
[ pdf | Abstract ]
[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 ]
[LMS04] Christof Löding, P. Madhusudan, and Olivier Serre. Visibly pushdown games. In Proceedings of the 24th Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2004, volume 3328 of Lecture Notes in Computer Science, pages 408-420. Springer, 2004. (c) Springer.
[ pdf | Abstract ]
[Roh04] Philipp Rohde. Moving in a crumbling network: The balanced case. In Proceedings of the 18th International Workshop on Computer Science Logic, CSL 2004, volume 3210 of Lecture Notes in Computer Science, pages 310-324. Springer, 2004. (c) Springer.
[ pdf | 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 ]
[Cac03a] T. Cachat. Games on pushdown graphs and extensions. PhD thesis, RWTH Aachen, 2003.
[ pdf | http | Abstract ]
[Cac03b] T. Cachat. Higher order pushdown automata, the Caucal hierarchy of graphs and parity games. In Proceedings of the 30th International Colloquium on Automata, Languages, and Programming, volume 2719 of Lecture Notes in Computer Science, pages 556-569. Springer, 2003. (c) Springer.
[ pdf | ps | Abstract ]
[CW03] A. Carayol and S. Wöhrle. The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In Proceedings of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2003, volume 2914 of Lecture Notes in Computer Science, pages 112-123. 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 ]
[Löd03] Christof Löding. Infinite graphs generated by tree rewriting. PhD thesis, RWTH Aachen, Germany, 2003.
[ pdf ]
[LR03b] Christof Löding and Philipp Rohde. Solving the sabotage game is PSPACE-hard. Technical Report AIB-05-2003, RWTH Aachen, 2003.
[ pdf | Abstract ]
[LR03c] Christof Löding and Philipp Rohde. Solving the sabotage game is PSPACE-hard. In Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science, MFCS 2003, volume 2747 of Lecture Notes in Computer Science, pages 531-540. Springer, 2003. (c) Springer.
[ pdf | ps | Abstract ]
[LR03a] Christof Löding and Philipp Rohde. Model checking and satisfiability for sabotage modal logic. In Proceedings of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2003, volume 2914 of Lecture Notes in Computer Science, pages 302-313. Springer, 2003. (c) Springer.
[ pdf | ps | 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.
[Wal03] N. Wallmeier. Symbolische Synthese zustandsbasierter reaktiver Programme. Diplomarbeit, RWTH Aachen, 2003.
[ pdf | ps ]
[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

[Cac02a] T. Cachat. The power of one-letter rational languages. In Proceedings of the 5th international conference Developments in Language Theory, volume 2295 of Lecture Notes in Computer Science, pages 145-154. Springer, 2002. (c) Springer.
[ pdf | ps | Abstract ]
[Cac02b] T. Cachat. Symbolic strategy synthesis for games on pushdown graphs. In Proceedings of the 29th International Colloquium on Automata, Languages, and Programming, volume 2380 of Lecture Notes in Computer Science, pages 704-715. Springer, 2002. (c) Springer.
[ pdf | ps | Abstract ]
[Cac02c] T. Cachat. Two-way tree automata solving pushdown games. In E. Grädel, W. Thomas, and T. Wilke, editors, Automata, Logics, and Infinite Games [GTW02], volume 2500 of Lecture Notes in Computer Science, pages 303-317. Springer, 2002. (c) Springer.
[ pdf | ps | Abstract ]
[Cac02d] T. Cachat. Uniform solution of parity games on prefix-recognizable graphs. In Antonin Kucera and Richard Mayr, editors, Proceedings of the 4th International Workshop on Verification of Infinite-State Systems, volume 68 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2002. (c) Elsevier Science.
[ pdf | ps | Abstract ]
[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.
[Löd02a] C. Löding. Ground tree rewriting graphs of bounded tree width. In Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science, STACS 2002, volume 2285 of Lecture Notes in Computer Science, pages 559-570. Springer, 2002. (c) Springer.
[ ps | Abstract ]
[Löd02b] C. Löding. Model-checking infinite systems generated by ground tree rewriting. In Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 2002, volume 2303 of Lecture Notes in Computer Science, pages 280-294. Springer, 2002. (c) Springer.
[ ps | Abstract ]
[LR02] Benedikt Löwe and Philipp Rohde. Games of length omega times two. Proceedings of the American Mathematical Society, 130:1247-1248, 2002.
[ ps | Abstract ]
[MST02] O. Matz, N. Schweikardt, and W. Thomas. The monadic quantifier alternation hierachy over grids and graphs. Information and Computation, 179:356-383, 2002.
[Roh02] Philipp Rohde. On the expressive power of the monadic second order logic and the propositional mu-calculus. In E. Grädel, W. Thomas, and T. Wilke, editors, Automata, Logics, and Infinite Games, volume 2500 of Lecture Notes in Computer Science, pages 239-257. Springer, 2002. (c) Springer.
[ ps | Abstract ]
[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

[Cac01] T. Cachat. The power of one-letter rational languages. Technical Report AIB-03-2001, RWTH Aachen, 2001. Preliminary version of [Cac02a].
[ ps | Abstract ]
[GW01] M. Grohe and S. Wöhrle. An existential locality theorem. In Proceedings of the 10th Annual Conference of the European Association for Computer Science Logic, CSL 2001, volume 2142 of Lecture Notes in Computer Science, pages 99-114. Springer, 2001. Full version [GW04]. (c) Springer.
[ pdf | ps | Abstract ]
[Löd01] C. Löding. Efficient minimization of deterministic weak omega-automata. Information Processing Letters, 79(3):105-109, 2001.
[ pdf | Abstract ]
[Roh01] Philipp Rohde. Über Erweiterungen des Axioms der Determiniertheit. Diplomarbeit, Rheinische Friedrich-Wilhelms-Universität Bonn, 2001.
[ pdf | Abstract ]
[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 ]
[Wöh01] S. Wöhrle. Lokalität in der Logik und algorithmische Anwendungen. Diplomarbeit, Albert-Ludwigs-Universität Freiburg, 2001.

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.
[LV00] H. Lescow and J. Vöge. Minimal separating sets for transformations of omega-automata. Theoretical Computer Science, 231:47-58, 2000.
[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 ]
[SV00a] D. Schmitz and J. Vöge. Implementation of a strategy improvement algorithm for parity games. In Proceedings of the fifth International conference on Implementation and Application of Automata, pages 45-51, 2000.
[ ps ]
[SV00b] D. Schmitz and J. Vöge. The package omega. Manual, RWTH Aachen, 2000.
[ ps ]
[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 ]
[Vög00] J. Vöge. Strategiesynthese für Paritätsspiele auf endlichen Graphen. PhD thesis, RWTH Aachen, 2000.
[ pdf ]
[VJ00a] J. Vöge and M. Jurdzinski. A discrete strategy improvement algorithm for solving parity games. In Proceedings of the 12th International Conference on Computer Aided Verification, CAV, volume 1855 of Lecture Notes in Computer Science, pages 202-215. Springer, 2000. (c) Springer.
[ ps ]
[VJ00b] J. Vöge and M. Jurdzinski. A discrete strategy improvement algorithm for solving parity games. Technical Report AIB-2000-2, RWTH Aachen, 2000.
[ ps ]

1999

[DW99] M. Dickhöfer and Th. Wilke. Timed alternating tree automata: the automata-theoretic solution to the TCTL model checking problem. In Automata, Languages and Programming, 26th international colloquium, volume 1644 of Lecture Notes in Computer Science, pages 281-290. Springer, 1999. (c) Springer.
[Löd99] C. Löding. Optimal bounds for the transformation of omega-automata. In Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science, volume 1738 of Lecture Notes in Computer Science, pages 97-109. Springer, 1999. (c) Springer.
[ ps | Abstract ]
[Mat99] O. Matz. Dot-depth and monadic quantifier elimination over pictures. Technical Report AIB-99-08, RWTH Aachen, 1999.
[ ps ]
[Tho99a] W. Thomas. Boolesche Logik und Büchi-Elgot-Trakhtenbrot-Logik in der Beschreibung diskreter Systeme. In P. Horster, editor, Angewandte Mathematik, insbesondere Informatik, pages 282-300. Vieweg, 1999.
[ ps ]
[Tho99b] W. Thomas. Complementation of Büchi automata revisited. In J. Karhumäki, H.A. Maurer, G. Paun, and G. Rozenberg, editors, Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pages 109-120. Springer, 1999.
[Tho99c] W. Thomas, editor. Proceedings of the 2nd International Conference on Foundations of Software Science and Computation Structures, FoSSaCS '99, volume 1578 of Lecture Notes in Computer Science, Amsterdam, 1999. Springer.
[Wil99b] Th Wilke. CTL+ is exponentially more succinct than CTL. In Foundations of Software Technology and Theoretical Computer Science: 19th Conference, volume 1738 of Lecture Notes in Computer Science, pages 110-121. Springer, 1999. Technical Report: [Wil99c]. (c) Springer.
[Wil99c] Th. Wilke. CTL+ is exponentially more succinct than CTL. Technical Report AIB 99-7, RWTH Aachen, Fachgruppe Informatik, 1999. Conference paper: [Wil99b].
[Wil99a] Th. Wilke. Classifying discrete temporal properties. In STACS'99, volume 1563 of Lecture Notes in Computer Science, pages 32-46. Springer, 1999. (c) Springer.

1998

[DW98] M. Dickhöfer and Th. Wilke. The automata-theoretic method works for TCTL model checking. Technical Report 9811, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, 1998.
[LLT98] B. Leoniuk, H. Lescow, and W. Thomas. Singleton acceptance conditions in omega-automata. Technical Report 9808, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Germany, 1998.
[Löd98] C. Löding. Methods for the transformation of omega-automata: Complexity and connection to second order logic. Diplomarbeit, Christian-Albrechts-Universität of Kiel, 1998.
[ ps ]
[Mat98c] O. Matz. One quantifier will do in existential monadic second order logic over grids. In Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, pages 751-759. Springer, 1998. (c) Springer.
[ ps ]
[Mat98b] O. Matz. On piecewise testable, starfree, and recognizabel picture languages. In Foundations of Software Science and Computation Structures, volume 1378 of Lecture Notes in Computer Science, pages 203-210. Springer, 1998. (c) Springer.
[ ps ]
[Mat98a] O. Matz. First order closure and the monadic second order alternation hierachy. Technical Report 9807, Christian-Albrechts-Universiät Kiel, 1998.
[ ps ]
[NT98] N. Nielsen and W. Thomas, editors. Computer Science Logic '97, selected papers, volume 1414 of Lecture Notes in Computer Science. Springer, 1998.
[PWW98] D. Peled, Th. Wilke, and P. Wolper. An algorithmic approach for checking closure properties of temporal logic specifications and omega-regular languages. Theoretical Computer Science, 195(2):183-203, 1998.
[TW98] D. Thérien and Th. Wilke. Over words, two variables are as powerful as one quantifier alternation: FO2 = Sigma2 Pi2. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pages 234-240, 1998.
[Tho98] W. Thomas. Monadic logic and automata: Recent developments. In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science, LICS '98, pages 136-138, Indianapolis, Indiana, 1998. IEEE Computer Society.
[Wil98] Th. Wilke. Classifying discrete temporal properties. Habilitationsschrift (post-doctoral thesis), April 1998.

Vor 1998

[BMUV97] N. Buhrke, O. Matz, S. Ulbrand, and J. Vöge. The automata theory package omega. In Proceedings of the 2nd International Workshop on Implementing Automata (WIA), volume 1436 of Lecture Notes in Computer Science, pages 228-231. Springer, 1997. (c) Springer.
[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.
[EVW97] K. Etessami, M.Y. Vardi, and Th. Wilke. First-order logic with two variables and unary temporal logic. In Proceedings 12th Annual IEEE Symposium on Logic in Computer Science, pages 228-235. IEEE, 1997.
[HSW97] J. Hromkovic, S. Seibert, and Th. Wilke. Translating regular expressions into small epsilon-free nondeterministic automata. In STACS'97, volume 1200 of Lecture Notes in Computer Science, pages 55-66. Springer, 1997. (c) Springer.
[LV97] H. Lescow, , and J. Vöge. Minimal seperating sets for Muller automata. In Proceedings of the 2nd International Workshop on Implementing Automata (WIA), volume 1436 of Lecture Notes in Computer Science, pages 109-121. Springer, 1997. (c) Springer.
[Mat97] O. Matz. Regular expressions and context-free grammars for picture languages. In Proceedings of the Symposium on Theoretical Aspects of Computer Science, volume 1200 of Lecture Notes in Computer Science, pages 283-294. Springer, 1997. (c) Springer.
[ ps ]
[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.
[PW97] D. Peled and Th. Wilke. Stutter-invariant temporal properties are expressible without the next-time operator. Information Processing Letters, 63(5):243-246, 1997.
[SW97] S. Seibert and Th. Wilke. Bounds for approximating MAXLINEG3-2 and MAXEkSAT. In Lectures on Proof Verification and Approximation Algorithms, volume 1367 of Lecture Notes in Computer Science, pages 179-212. Springer, 1997. (c) Springer.
[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 ]
[Wil97] Th. Wilke. Star-free picture expressions are strictly weaker than first-order logic. In Automata, Languages and Programming, 24th international colloquium, volume 1256 of Lecture Notes in Computer Science, pages 347-357. Springer, 1997. (c) Springer.
[BLV96] N. Buhrke, H. Lescow, , and J. Vöge. Strategy construction in infinite games with Streett and Rabin chain winning conditions. In Proceeding of the International Conference on Tools and Algorithms for Construction and Analysis of Systems,, volume 1055 of Lecture Notes in Computer Science, pages 207-225. Springer, 1996. (c) Springer.
[EFT96] H.-D. Ebbinghaus, J. Flum, and W. Thomas. Einführung in die Mathematische Logik. Spektrum Akademischer Verlag, Heidelberg, fourth edition, 1996.
[EW96] K. Etessami and Th. Wilke. An until hierarchy for temporal logic. In Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pages 108-117. IEEE, 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.
[PWW96] D. Peled, Th. Wilke, and P. Wolper. An algorithmic approach for checking closure properties of omega-regular languages. In Concur '96: Concurrency Theory, volume 1119 of Lecture Notes in Computer Science, pages 596-610. Springer, 1996. (c) Springer.
[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.
[TW96a] D. Thérien and Th. Wilke. Temporal logic and semidirect products: An effective characterization of the until hierarchy. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 256-263. IEEE, 1996.
[TW96b] D. Thérien and Th. Wilke. Temporal logic and semidirect products: An effective characterization of the until hierarchy. Technical report 96-28, DIMACS, 1996. Conference paper: [TW96a].
[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 ]
[Wil96] Th. Wilke. An algebraic characterization of frontier testable tree languages. Theoretical Computer Science, 154(1):85-106, 1996.
[WY96] Th. Wilke and H. Yoo. Computing the Rabin index of a regular language of infinite words. Information and Computation, 130(1):61-70, 1996.
[Mat95] O. Matz. Klassifizierung von Bildsprachen mit rationalen Ausdrücken. Diplomarbeit, Christian-Albrechts-Universität Kiel, 1995.
[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.
[MP95] O. Matz and A Potthoff. Computing small nondeterministic finite automata. In Tools and Algorithms for the Construction and analysis of Systems, volume NS-95-s of BRICS Notes Series, pages 74-88, 1995.
[ ps ]
[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.
[WY95] Th. Wilke and H. Yoo. Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time. In TAPSOFT '95: Theory and Practive of Software Development, volume 915 of Lecture Notes in Computer Science, pages 288-302. Springer, 1995. (c) Springer.
[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.
[Wil94b] Th. Wilke. Specifying timed state sequences in powerful decidable logics and timed automata. In Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 863 of Lecture Notes in Computer Science, pages 694-715. Springer, 1994. (c) Springer.
[Wil94a] Th. Wilke. Automaten und Logiken zur Beschreibung zeitabhängiger Systeme. Technical Report 9408, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, 1994.
[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.
[Wil93a] Th. Wilke. An algebraic theory for regular languages of finite and infinite words. International Journal Algebra and Computation, 3(4):447-489, 1993.
[Wil93d] Th. Wilke. Locally threshold testable languages of infinite words. In STACS'93, volume 665 of Lecture Notes in Computer Science, pages 607-616. Springer, 1993. (c) Springer.
[Wil93b] Th. Wilke. Algebras for classifying regular tree languages and an application to frontier testability. In Automata, Languages and Programming, 20th international colloquium, volume 700 of Lecture Notes in Computer Science, pages 347-358. Springer, 1993. (c) Springer.
[Wil93c] Th. Wilke. Algebras for classifying regular tree languages and an application to frontier testability. Technical Report 9313, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, 1993. Conference paper: [Wil93b].
[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.
[Wil92b] Th. Wilke. Locally threshold testable languages of infinite words. Technical Report 9203, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, 1992. Conference paper: [Wil93d].
[Wil92a] Th. Wilke. An algebraic theory for regular languages of finite and infinite words. Technical Report 9202, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, 1992. Journal version: [Wil93a].
[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.
[Wil91] Th. Wilke. An Eilenberg Theorem for omega-languages. In Automata, Languages and Programming, 18th international colloquium, volume 510 of Lecture Notes in Computer Science, pages 588-599. Springer, 1991. (c) Springer.
[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.