Inhaltspezifische Aktionen

Publikationen

Meine wissenschaftlichen Arbeiten liegen vor allem in der Theoretischen Informatik und in der Didaktik der Informatik. Forschungsschwerpunkte sind Automaten und formale Sprachen, reversible Berechnungsmodelle, Beschreibungskomplexität sowie DNA-inspirierte String-Assembling-Systeme.

Das Publikationsverzeichnis umfasst:

  • 34 Veröffentlichungen in referierten Zeitschriften,
  • 1 Monografie beziehungsweise technischer Bericht,
  • 1 Beitrag zu einem Buch,
  • 52 Veröffentlichungen in referierten Proceedings,
  • 2 aktuelle Preprints und
  • 3 Qualifikationsschriften.

Bei Veröffentlichungen mit mehreren Autorinnen und Autoren sind die Anteile im Durchschnitt gleichmäßig verteilt.

Informatikdidaktik

  • Katja Lengnink, Matthias Wendlandt: Kritisch-reflexive Bildung zu Künstlicher Intelligenz (KI) im Kontext von Nachhaltigkeit: Ein Ansatz für die Lehrkräftebildung. In: SEMINAR, vol. 32(2), pp. 42–52. Bielefeld: wbv Publikation (2026).
  • Jakob Frensch, Katja Lengnink, Fenja Martin, Matthias Wendlandt: Datenbanken reflexionsorientiert unterrichten. In: INFOS 2025, pp. 277–278 (2025).
  • Marcel Knapp, Matthias Wendlandt: Neuronale Netze verstehen – schrittweise, interaktiv und reflexionsorientiert. In: INFOS 2025, pp. 281–282 (2025).
  • Katja Lengnink, Katharina Wendlandt, Matthias Wendlandt: Reflexionsorientierung im Informatikunterricht. In: INFOS 2025, pp. 285–286 (2025).
  • Christoph Meinel, Michael Galbas, Andreas Dengel, Matthias Wendlandt: Konzeption eines integrativen Schulfaches „Digitale Welt“ für hessische Schulen. Technische Berichte des Hasso-Plattner-Instituts für Digital Engineering an der Universität Potsdam, Band 160. Universitätsverlag Potsdam, 34 Seiten, ISBN 978-3-86956-582-8 (2024).
  • Katharina Wendlandt, Matthias Wendlandt: Formale Aspekte endlicher Automaten entdecken. In: GI-Fachtagung Informatik und Schule. Lecture Notes in Informatics, vol. 313, pp. 231–239 (2021).
  • Niko Hausner, Katharina Wendlandt, Matthias Wendlandt: Informatikunterricht – Ein Muss zur politischen Mündigkeit. In: GI-Fachtagung Informatik und Schule. Lecture Notes in Informatics, vol. 288, pp. 109–118 (2019).
  • Sabrina Hoffmann, Katharina Wendlandt, Matthias Wendlandt: Algorithmisieren im Grundschulalter. In: GI-Fachtagung Informatik und Schule. Lecture Notes in Informatics, vol. 274, pp. 73–82 (2017).

Referierte Zeitschriftenbeiträge

  • Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt: Deterministic pushdown automata with translucent input letters. In: Information and Computation, vol. 308, article 105403 (2026).
  • Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt: On properties of languages accepted by deterministic pushdown automata with translucent input letters. In: Theoretical Computer Science, vol. 1072, article 115890 (2026).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Complexity of exclusive nondeterministic finite automata. In: Information and Computation, vol. 306, article 105336 (2025).
  • Matthias Wendlandt, Daniel Noble: On some Properties of Sticker Systems. In: Journal of Automata, Languages and Combinatorics, vol. 30(1–3), pp. 213–226 (2025).
  • Martin Kutrib, Matthias Wendlandt: Variants of string assembling systems. In: Natural Computing, vol. 23(1), pp. 131–156 (2024).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: On the power of pushing or stationary moves for input-driven pushdown automata. In: Theoretical Computer Science, vol. 996, article 114503 (2024).
  • Martin Kutrib, Matthias Wendlandt: State complexity of finite partial languages. In: Theoretical Computer Science, vols. 966–967, article 114001 (2023).
  • Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Input-Driven Double-Head Pushdown Automata. In: International Journal of Foundations of Computer Science, vol. 33, pp. 285–311 (2022).
  • Friedrich Otto, Matthias Wendlandt: Reversibility for stateless ordered RRWW-automata. In: Acta Informatica, vol. 58, pp. 397–425 (2021).
  • Henning Fernau, Martin Kutrib, Matthias Wendlandt: Self-Verifying Pushdown and Queue Automata. In: Fundamenta Informaticae, vol. 180, pp. 1–28 (2021).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Input-driven multi-counter automata. In: Theoretical Computer Science, vol. 870, pp. 121–136 (2021).
  • Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Boosting Reversible Pushdown and Queue Machines by Preprocessing. In: International Journal of Foundations of Computer Science, vol. 31, pp. 1021–1049 (2020).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Transducing reversibly with finite state machines. In: Theoretical Computer Science, vol. 787, pp. 111–126 (2019).
  • Martin Kutrib, Giovanni Pighizzini, Matthias Wendlandt: Descriptional complexity of limited automata. In: Information and Computation, vol. 259, pp. 259–276 (2018).
  • Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Diving into the queue. In: RAIRO – Theoretical Informatics and Applications, vol. 52, pp. 89–110 (2018).
  • Martin Kutrib, Matthias Wendlandt: Expressive capacity of subregular expressions. In: RAIRO – Theoretical Informatics and Applications, vol. 52, pp. 201–218 (2018).
  • Martin Kutrib, Matthias Wendlandt: Reversible Limited Automata. In: Fundamenta Informaticae, vol. 155, pp. 31–58 (2017).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Tinput-Driven Pushdown, Counter, and Stack Automata. In: Fundamenta Informaticae, vol. 155, pp. 59–88 (2017).
  • Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Descriptional Complexity of Bounded Regular Languages. In: Journal of Automata, Languages and Combinatorics, vol. 22, pp. 93–121 (2017).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Shrinking one-way cellular automata. In: Natural Computing, vol. 16, pp. 383–396 (2017).
  • Martin Kutrib, Matthias Wendlandt: Concatenation-free languages. In: Theoretical Computer Science, vol. 679, pp. 83–94 (2017).
  • Markus Holzer, Sebastian Jakobi, Matthias Wendlandt: On the Computational Complexity of Partial Word Automata Problems. In: Fundamenta Informaticae, vol. 148, pp. 267–289 (2016).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Reversible Queue Automata. In: Fundamenta Informaticae, vol. 148, pp. 341–368 (2016).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: When input-driven pushdown automata meet reversibility. In: RAIRO – Theoretical Informatics and Applications, vol. 50, pp. 313–330 (2016).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Set Automata. In: International Journal of Foundations of Computer Science, vol. 27, pp. 187–214 (2016).
  • Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt: Deterministic One-Way Turing Machines with Sublinear Space. In: Fundamenta Informaticae, vol. 136, pp. 139–155 (2015).
  • Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt: Deterministic input-driven queue automata: Finite turns, decidability, and closure properties. In: Theoretical Computer Science, vol. 578, pp. 58–71 (2015).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Head and state hierarchies for unary multi-head finite automata. In: Acta Informatica, vol. 51, pp. 553–569 (2014).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Simulations of Unary One-Way Multi-Head Finite Automata. In: International Journal of Foundations of Computer Science, vol. 25, pp. 877–896 (2014).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Stateless One-Way Multi-Head Finite Automata with Pebbles. In: International Journal of Foundations of Computer Science, vol. 25, pp. 1141–1160 (2014).
  • Martin Kutrib, Matthias Wendlandt: Bidirectional string assembling systems. In: RAIRO – Theoretical Informatics and Applications, vol. 48, pp. 39–59 (2014).
  • Henning Bordihn, Martin Kutrib, Matthias Wendlandt: Nonterminal Controlled String Assembling Systems. In: Journal of Automata, Languages and Combinatorics, vol. 19, pp. 33–44 (2014).
  • Martin Kutrib, Matthias Wendlandt: String Assembling Systems. In: RAIRO – Theoretical Informatics and Applications, vol. 46, pp. 593–613 (2012).

Monografien und Buchbeiträge

  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Queue Automata: Foundations and Developments. Reversibility and Universality, pp. 385–431 (2018).

Referierte Proceedingsbeiträge

  • Martin Kutrib, Ian McQuillan, Priscilla Raucci, Matthias Wendlandt: State-Limited Inductive Inference of Cellular Automata. In: DCFS 2026, pp. 110–121 (2026).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: On some Open Problems for Finite Automata with Translucent Input Letters. In: NCMA 2026, pp. 73–87 (2026).
  • Martin Kutrib, Matthias Wendlandt: String Assembling Systems: Origins and Directions. In: Languages of Cooperation and Communication 2025, pp. 210–237 (2025).
  • Martin Kutrib, Priscilla Raucci, Matthias Wendlandt: Subregular Expressions with Two Operations. In: DLT 2025, pp. 229–243 (2025).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Input-Driven Pushdown Automata with Translucent Input Letters. In: NCMA 2025, pp. 29–43 (2025).
  • Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt: Deterministic Pushdown Automata with Translucent Input Letters. In: DLT 2024, pp. 203–217 (2024).
  • Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt: On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters. In: CIAA 2024, pp. 208–220 (2024).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Complexity of Unary Exclusive Nondeterministic Finite Automata. In: NCMA 2024, pp. 136–149 (2024).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Complexity of Exclusive Nondeterministic Finite Automata. In: DCFS 2023. Lecture Notes in Computer Science, vol. 13918, pp. 121–133 (2023).
  • Martin Kutrib, Matthias Wendlandt: State Complexity of Finite Partial Languages. In: Theory and Practice of Computer Science. Lecture Notes in Computer Science, vol. 13439, pp. 170–183 (2022).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: On the Power of Pushing or Stationary Moves for Input-Driven Pushdown Automata. In: Theory and Practice of Computer Science. Lecture Notes in Computer Science, vol. 13266, pp. 140–151 (2022).
  • Martin Kutrib, Matthias Wendlandt: State Complexity of Partial Word Finite Automata. In: Theory and Practice of Computer Science. Lecture Notes in Computer Science, vol. 13037, pp. 113–124 (2021).
  • Martin Kutrib, Matthias Wendlandt: String Assembling Systems: Comparison to Sticker Systems and Decidability. In: Theory and Practice of Computer Science. Lecture Notes in Computer Science, vol. 12984, pp. 101–115 (2021).
  • Martin Kutrib, Matthias Wendlandt: Multi-stranded String Assembling Systems. In: Theory and Practice of Computer Science. Lecture Notes in Computer Science, vol. 11376, pp. 285–297 (2019).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Input-Driven Multi-counter Automata. In: Implementation and Application of Automata. Lecture Notes in Computer Science, vol. 11601, pp. 197–208 (2019).
  • Martin Kutrib, Matthias Wendlandt: Parametrizing String Assembling Systems. In: Implementation and Application of Automata. Lecture Notes in Computer Science, vol. 10977, pp. 236–247 (2018).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Boosting Pushdown and Queue Machines by Preprocessing. In: Implementation and Application of Automata. Lecture Notes in Computer Science, vol. 10977, pp. 28–40 (2018).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Fast One-Way Cellular Automata with Reversible Mealy Cells. In: Cellular Automata and Discrete Complex Systems. Lecture Notes in Computer Science, vol. 10248, pp. 139–150 (2017).
  • Henning Fernau, Martin Kutrib, Matthias Wendlandt: Self-verifying pushdown automata. In: Non-Classical Models of Automata and Applications. books@ocg.at, vol. 329, pp. 103–117 (2017).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Transducing Reversibly with Finite State Machines. In: Implementation and Application of Automata. Lecture Notes in Computer Science, vol. 10329, pp. 151–162 (2017).
  • Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Input-Driven Double-Head Pushdown Automata. In: Automata and Formal Languages. Electronic Proceedings in Theoretical Computer Science, vol. 252, pp. 128–142 (2017).
  • Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Descriptional Complexity of Bounded Regular Languages. In: Descriptional Complexity of Formal Systems. Lecture Notes in Computer Science, vol. 9777, pp. 138–152 (2016).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Input-Driven Queue Automata with Internal Transductions. In: Language and Automata Theory and Applications. Lecture Notes in Computer Science, vol. 9618, pp. 156–167 (2016).
  • Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Diving into the queue. In: Non-Classical Models of Automata and Applications. books@ocg.at, vol. 321, pp. 89–104 (2016).
  • Martin Kutrib, Matthias Wendlandt: Expressive capacity of subregular expressions. In: Non-Classical Models of Automata and Applications. books@ocg.at, vol. 321, pp. 227–242 (2016).
  • Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Boosting Reversible Pushdown Machines by Preprocessing. In: Reversible Computation. Lecture Notes in Computer Science, vol. 9720, pp. 89–104 (2016).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Shrinking One-Way Cellular Automata. In: Cellular Automata and Discrete Complex Systems. Lecture Notes in Computer Science, vol. 9099, pp. 141–154 (2015).
  • Martin Kutrib, Matthias Wendlandt: On Simulation Cost of Unary Limited Automata. In: Descriptional Complexity of Formal Systems. Lecture Notes in Computer Science, vol. 9118, pp. 153–164 (2015).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Tinput-Driven Pushdown Automata. In: Computations, and Universality. Lecture Notes in Computer Science, vol. 9288, pp. 94–112 (2015).
  • Martin Kutrib, Matthias Wendlandt: Reversible Limited Automata. In: Machines, Computations, and Universality. Lecture Notes in Computer Science, vol. 9288, pp. 113–128 (2015).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: When input-driven pushdown automata meet reversibility. In: Non-Classical Models of Automata and Applications. books@ocg.at, vol. 318, pp. 141–157 (2015).
  • Friedrich Otto, Matthias Wendlandt, Kent Kwee: Reversible Ordered Restarting Automata. In: Reversible Computation. Lecture Notes in Computer Science, vol. 9138, pp. 60–75 (2015).
  • Martin Kutrib, Matthias Wendlandt: Expressive Capacity of Concatenation Freeness. In: Implementation and Application of Automata. Lecture Notes in Computer Science, vol. 9223, pp. 199–210 (2015).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Real-Time Reversible One-Way Cellular Automata. In: Automata. Lecture Notes in Computer Science, vol. 8996, pp. 56–69 (2014).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Regularity and Size of Set Automata. In: Descriptional Complexity of Formal Systems. Lecture Notes in Computer Science, vol. 8614, pp. 282–293 (2014).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Deterministic Set Automata. In: Developments in Language Theory. Lecture Notes in Computer Science, vol. 8633, pp. 303–314 (2014).
  • Markus Holzer, Sebastian Jakobi, Matthias Wendlandt: On the computational complexity of partial word automata problems. In: Non-Classical Models of Automata and Applications. books@ocg.at, vol. 304, pp. 131–146 (2014).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Reversible queue automata. In: Non-Classical Models of Automata and Applications. books@ocg.at, vol. 304, pp. 163–178 (2014).
  • Martin Kutrib, Katja Meckel, Matthias Wendlandt: Parameterized Prefix Distance between Regular Languages. In: Current Trends in Theory and Practice of Computer Science. pp. 419–430 (2014).
  • Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt: Deterministic one-way Turing machines with sublinear space bounds. In: Non-Classical Models of Automata and Applications. books@ocg.at, vol. 294, pp. 195–208 (2013).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: One-Way Multi-Head Finite Automata with Pebbles but No States. In: Developments in Language Theory. Lecture Notes in Computer Science, vol. 7907, pp. 313–324 (2013).
  • Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt: Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. In: Implementation and Application of Automata. Lecture Notes in Computer Science, vol. 7982, pp. 232–243 (2013).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: Size of Unary One-Way Multi-Head Finite Automaton. In: Descriptional Complexity of Formal Systems. Lecture Notes in Computer Science, vol. 8031, pp. 148–159 (2013).
  • Martin Kutrib, Matthias Wendlandt: String Assembling Systems. In: Non-Classical Models of Automata and Applications. books@ocg.at, vol. 282, pp. 179–192 (2012).
  • Martin Kutrib, Matthias Wendlandt: Bidirectional String Assembling Systems. In: Non-Classical Models of Automata and Applications. books@ocg.at, vol. 290, pp. 107–121 (2012).
  • Martin Kutrib, Andreas Malcher, Matthias Wendlandt: States and Heads Do Count for Unary Multi-head Finite Automata. In: Developments in Language Theory. Lecture Notes in Computer Science, vol. 7410, pp. 214–225 (2012).

Aktuelle Preprints

  • Martin Kutrib, Ian McQuillan, Priscilla Raucci, Matthias Wendlandt: Inductive Inference of Cellular Automata. CoRR abs/2608.24240 (2026).
  • Martin Kutrib, Matthias Wendlandt: Subregular Expressions and Their Expressive Power. CoRR abs/2608.24244 (2026).

Habilitationsschrift, Dissertation und Examensarbeit

  • Matthias Wendlandt: String Assembling Systems. Justus-Liebig-Universität Gießen 2020. Habilitationsschrift.
  • Matthias Wendlandt: Formalsprachliche Aspekte von XML. Justus-Liebig-Universität Gießen 2008. Dissertation.
  • Matthias Wendlandt: Erarbeitung eines XML Parsers. Justus-Liebig-Universität Gießen 2005. Examensarbeit.