Formalsprachliche Aspekte von XML. - Matthias Wendlandt (2007)

States and Heads Do Count for Unary Multi-head Finite Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Developments in Language Theory, 2012)

String Assembling Systems. - Martin Kutrib; Matthias Wendlandt (RAIRO Theor. Informatics Appl., 2012)

Size of Unary One-Way Multi-head Finite Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (DCFS, 2013)

One-Way Multi-Head Finite Automata with Pebbles But No States. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Developments in Language Theory, 2013)

Deterministic one-way Turing machines with sublinear space bounds. - Martin Kutrib; Julien Provillard; György Vaszil; Matthias Wendlandt (NCMA, 2013)

Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano; Matthias Wendlandt (CIAA, 2013)

Real-Time Reversible One-Way Cellular Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Automata, 2014)

Regularity and Size of Set Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (DCFS, 2014)

Deterministic Set Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Developments in Language Theory, 2014)

Parameterized Prefix Distance between Regular Languages. - Martin Kutrib; Katja Meckel; Matthias Wendlandt (SOFSEM, 2014)

Head and state hierarchies for unary multi-head finite automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Acta Informatica, 2014)

Simulations of Unary One-Way Multi-Head Finite Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Int. J. Found. Comput. Sci., 2014)

Stateless One-Way Multi-Head Finite Automata with Pebbles. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Int. J. Found. Comput. Sci., 2014)

Bidirectional string assembling systems. - Martin Kutrib; Matthias Wendlandt (RAIRO Theor. Informatics Appl., 2014)

Nonterminal Controlled String Assembling Systems. - Henning Bordihn; Martin Kutrib; Matthias Wendlandt (J. Autom. Lang. Comb., 2014)

On Simulation Cost of Unary Limited Automata. - Martin Kutrib; Matthias Wendlandt (DCFS, 2015)

Tinput-Driven Pushdown Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (MCU, 2015)

When input-driven pushdown automata meet reversibility. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (NCMA, 2015)

Reversible Ordered Restarting Automata. - Friedrich Otto; Matthias Wendlandt; Kent Kwee (RC, 2015)

Expressive Capacity of Concatenation Freeness. - Martin Kutrib; Matthias Wendlandt (CIAA, 2015)

Deterministic One-Way Turing Machines with Sublinear Space. - Martin Kutrib; Julien Provillard; György Vaszil; Matthias Wendlandt (Fundam. Informaticae, 2015)

Deterministic input-driven queue automata: Finite turns, decidability, and closure properties. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano; Matthias Wendlandt (Theor. Comput. Sci., 2015)

Input-Driven Queue Automata with Internal Transductions. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (LATA, 2016)

Boosting Reversible Pushdown Machines by Preprocessing. - Holger Bock Axelsen; Martin Kutrib; Andreas Malcher; Matthias Wendlandt (RC, 2016)

On the Computational Complexity of Partial Word Automata Problems. - Markus Holzer 001; Sebastian Jakobi; Matthias Wendlandt (Fundam. Informaticae, 2016)

Reversible Queue Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Fundam. Informaticae, 2016)

Set Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Int. J. Found. Comput. Sci., 2016)

When input-driven pushdown automata meet reversiblity. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (RAIRO Theor. Informatics Appl., 2016)

Fast One-Way Cellular Automata with Reversible Mealy Cells. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (AUTOMATA, 2017)

Self-verifying pushdown automata. - Henning Fernau; Martin Kutrib; Matthias Wendlandt (NCMA, 2017)

Algorithmisieren im Grundschulalter. - Sabrina Hoffmann; Katharina Wendlandt; Matthias Wendlandt (INFOS, 2017)

Tinput-Driven Pushdown, Counter, and Stack Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Fundam. Informaticae, 2017)

Reversible Limited Automata. - Martin Kutrib; Matthias Wendlandt (Fundam. Informaticae, 2017)

Descriptional Complexity of Bounded Regular Languages. - Andrea Herrmann 002; Martin Kutrib; Andreas Malcher; Matthias Wendlandt (J. Autom. Lang. Comb., 2017)

Shrinking one-way cellular automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Nat. Comput., 2017)

Concatenation-free languages. - Martin Kutrib; Matthias Wendlandt (Theor. Comput. Sci., 2017)

Queue Automata: Foundations and Developments. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Reversibility and Universality, 2018)

Boosting Pushdown and Queue Machines by Preprocessing. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (CIAA, 2018)

Parametrizing String Assembling Systems. - Martin Kutrib; Matthias Wendlandt (CIAA, 2018)

Descriptional complexity of limited automata. - Martin Kutrib; Giovanni Pighizzini; Matthias Wendlandt (Inf. Comput., 2018)

Diving into the queue. - Simon Beier; Martin Kutrib; Andreas Malcher; Matthias Wendlandt (RAIRO Theor. Informatics Appl., 2018)

Expressive capacity of subregular expressions. - Martin Kutrib; Matthias Wendlandt (RAIRO Theor. Informatics Appl., 2018)

Informatikunterricht - Ein Muss zur politischen Mündigkeit. - Niko Hausner; Katharina Wendlandt; Matthias Wendlandt (INFOS, 2019)

Multi-stranded String Assembling Systems. - Martin Kutrib; Matthias Wendlandt (SOFSEM, 2019)

Transducing reversibly with finite state machines. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Theor. Comput. Sci., 2019)

Boosting Reversible Pushdown and Queue Machines by Preprocessing. - Holger Bock Axelsen; Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Int. J. Found. Comput. Sci., 2020)

State Complexity of Partial Word Finite Automata. - Martin Kutrib; Matthias Wendlandt (DCFS, 2021)

Formale Aspekte endlicher Automaten entdecken. - Katharina Wendlandt; Matthias Wendlandt (INFOS, 2021)

String Assembling Systems: Comparison to Sticker Systems and Decidability. - Martin Kutrib; Matthias Wendlandt (UCNC, 2021)

Reversibility for stateless ordered RRWW-automata. - Friedrich Otto; Matthias Wendlandt (Acta Informatica, 2021)

Self-Verifying Pushdown and Queue Automata. - Henning Fernau; Martin Kutrib; Matthias Wendlandt (Fundam. Informaticae, 2021)

Input-driven multi-counter automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Theor. Comput. Sci., 2021)

Input-Driven Double-Head Pushdown Automata. - Markus Holzer 001; Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Int. J. Found. Comput. Sci., 2022)

State complexity of finite partial languages. - Martin Kutrib; Matthias Wendlandt (Theor. Comput. Sci., 2023)

Deterministic Pushdown Automata with Translucent Input Letters. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano; Priscilla Raucci; Matthias Wendlandt (DLT, 2024)

On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano; Priscilla Raucci; Matthias Wendlandt (CIAA, 2024)

Complexity of Unary Exclusive Nondeterministic Finite Automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (NCMA, 2024)

On the power of pushing or stationary moves for input-driven pushdown automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Theor. Comput. Sci., 2024)

Variants of string assembling systems. - Martin Kutrib; Matthias Wendlandt (Nat. Comput., 2024)

Subregular Expressions with Two Operations. - Martin Kutrib; Priscilla Raucci; Matthias Wendlandt (DLT, 2025)

Complexity of exclusive nondeterministic finite automata. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (Inf. Comput., 2025)

Input-Driven Pushdown Automata with Translucent Input Letters. - Martin Kutrib; Andreas Malcher; Matthias Wendlandt (NCMA, 2025)