Publications of Stefan Repke (né Schulz)
All Publications
[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 ] |
[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 ] |
[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 ] |
[Sch09] |
Stefan Schulz.
First-Order Logic with Reachability Predicates over Infinite
Systems.
Diploma thesis, RWTH-Aachen, 2009. [ pdf | Abstract ] |