Annual Report 2010 - Fachgruppe Informatik an der RWTH Aachen ...

[19] J. Olschewski and M. 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
[20] S. Schulz: First-Order Logic with Reachability Predicates on Infinite Systems, Proc.
FSTTCS 2010 (to appear)
[21] W. Thomas: On Monadic Theories of Monadic Predicates. in: Fields of Logic and
Computation – Festschrift for Yuri Gurevich (N. Dershowitz et al., eds), Lecture Notes in
Computer Science 6300, pages 615-626, Springer-Verlag 2010
[22] W. Thomas: Theoretische Informatik (Editorial) , Informatik-Spektrum 33, 429-431
(2010)
[23] W. Thomas: Theoretische Informatik - ein Kurzprofil, Informatik-Spektrum 33, 433-437
(2010)
[24] W. Thomas: "When nobody else dreamed of these things" - Axel Thue und die
Termersetzung, Informatik-Spektrum 33, 504-508 (2010)
[25] W. Thomas, P. Weil, Preface of STACS 2007 Special Issue. Theory Comput. Syst. 46
(3), 397 (2010)
[26] W. Thomas, Finite Automata and the Analysis of Infinite Transition Systems, In: D.
D'Souza and P. Shankar, editors, Modern Applications of Automata Theory. World
Scientific, 2010 (to appear)
[27] K. Wong: Finite automata on unranked trees: extensions by arithmetical and equality
constraints, PhD thesis, RWTH Aachen, Germany, 2010.
[28] M. Zimmermann: Parametric LTL Games. Technical Report AIB-2010-11, RWTH
Aachen, 2010
263