• Exercise Automaten, Sprachen und Komplexität (WT 15/16, WT 16/17, WT 17/18)
• Exercise Automatentheorie (ST 19)
• Exercise Logik und Logikprogrammierung (ST 17, ST 18, ST 19)
• Exercise Verifikation (WT 16/17, WT 17/18, WT 18/19)

Fully refereed Papers

1. The Inclusion Structure of Partially Lossy Queue Monoids and their Trace Submonoids (with Dietrich Kuske, Olena Prianychnykova)
   RAIRO - Theoretical Informatics and Applications vol. 52(1), pages 55-86 (2018).
   [Download, DOI: 10.1051/ita/2018003, BibTeX] 

Conference Papers

1. Reachability Problems on Partially Lossy Queue Automata
   RP 2019, accepted.
2. The Cayley-Graph of the Queue Monoid: Logic and Decidability (with Faried Abu Zaid)
   FSTTCS 2018, Leibniz International Proceedings in Informatics vol. 122, pages 9:1-9:17 (2018).
   [Download, DOI: 10.4230/LIPIcs.FSTTCS.2018.9, BibTeX, Slides]
3. Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid
   STACS 2018, Leibniz International Proceedings in Informatics vol. 96, pages 45:1-45:14 (2018).
   [Download, DOI: 10.4230/LIPIcs.STACS.2018.45, BibTeX, Slides]
4. The transformation monoid of a partially lossy queue (with Dietrich Kuske)
   CSR 2017, Springer Lecture Notes in Computer Science vol. 10304, pages 191-205 (2017).
   [Download, DOI: 10.1007/978-3-319-58747-9_18, BibTeX, Slides]

Theses

1. Einbettungen in das Transformationsmonoid einer vergesslichen Warteschlange
   Master's Thesis, 2016
   [Download]
2. Analyse der Entscheidbarkeit diverser Probleme in automatischen Graphen
   Bachelor's Thesis, 2014
   [Download]

1. Reachability Problems on Partially Lossy Queue Automata
   Highlights of Logic, Games and Automata 2019, Warsaw. [Abstract, Slides]
   13th International Symposium on Reachability Problems 2019, Brussels. [Slides]
   28. Theorietag "Automaten und Formale Sprachen" 2018, Wittenberg. [Abstract, Slides]
2. The Cayley-Graph of the Queue Monoid: Logic and Decidability
   38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Ahmedabad. [Slides]
3. Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid
   Highlights of Logic, Games and Automata 2018, Berlin. [Abstract, Slides]
   35th Symposium on Theoretical Aspects of Computer Science 2018, Caen. [Slides]
   27. Theorietag "Automaten und Formale Sprachen" 2017, Bonn. [Abstract, Slides]
4. The Transformation Monoid of a Partially Lossy Queue
   The 12th International Computer Science Symposium in Russia 2017, Kazan. [Slides]