Matthias Wendlandt

85 papers B 2C 18Journal 33Unranked 30

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Deterministic pushdown automata with translucent input letters. Inf. Comput. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt
2026	J	`jnl`	On properties of languages accepted by deterministic pushdown automata with translucent input letters. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt
2025	J	`jnl`	Complexity of exclusive nondeterministic finite automata. Inf. Comput. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2025	—	`conf`	Datenbanken reflexionsorientiert unterrichten. INFOS Jakob Frensch, Katja Lengnink, Fenja Martin, Matthias Wendlandt
2025	—	`conf`	Input-Driven Pushdown Automata with Translucent Input Letters. NCMA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2025	—	`conf`	Neuronale Netze verstehen - schrittweise, interaktiv und reflexionsorientiert. INFOS Marcel Knapp, Matthias Wendlandt
2025	J	`jnl`	On some Properties of Sticker Systems. J. Autom. Lang. Comb. Matthias Wendlandt, Daniel Noble
2025	—	`conf`	Reflexionsorientierung im Informatikunterricht. INFOS Katja Lengnink, Katharina Wendlandt, Matthias Wendlandt
2025	—	`conf`	String Assembling Systems: Origins and Directions. Languages of Cooperation and Communication Martin Kutrib, Matthias Wendlandt
2025	C	`conf`	Subregular Expressions with Two Operations. DLT Martin Kutrib, Priscilla Raucci, Matthias Wendlandt
2024	—	`conf`	Complexity of Unary Exclusive Nondeterministic Finite Automata. NCMA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2024	C	`conf`	Deterministic Pushdown Automata with Translucent Input Letters. DLT Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt
2024	C	`conf`	On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters. CIAA Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt
2024	J	`jnl`	On the power of pushing or stationary moves for input-driven pushdown automata. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2024	J	`jnl`	Variants of string assembling systems. Nat. Comput. Martin Kutrib, Matthias Wendlandt
2023	—	`conf`	Complexity of Exclusive Nondeterministic Finite Automata. DCFS Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2023	J	`jnl`	State complexity of finite partial languages. Theor. Comput. Sci. Martin Kutrib, Matthias Wendlandt
2022	J	`jnl`	Input-Driven Double-Head Pushdown Automata. Int. J. Found. Comput. Sci. Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2022	C	`conf`	On the Power of Pushing or Stationary Moves for Input-Driven Pushdown Automata. CIAA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2022	—	`conf`	State Complexity of Finite Partial Languages. DCFS Martin Kutrib, Matthias Wendlandt
2021	—	`conf`	Formale Aspekte endlicher Automaten entdecken. INFOS Katharina Wendlandt, Matthias Wendlandt
2021	J	`jnl`	Input-driven multi-counter automata. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2021	J	`jnl`	Reversibility for stateless ordered RRWW-automata. Acta Informatica Friedrich Otto, Matthias Wendlandt
2021	J	`jnl`	Self-Verifying Pushdown and Queue Automata. Fundam. Informaticae Henning Fernau, Martin Kutrib, Matthias Wendlandt
2021	—	`conf`	State Complexity of Partial Word Finite Automata. DCFS Martin Kutrib, Matthias Wendlandt
2021	—	`conf`	String Assembling Systems: Comparison to Sticker Systems and Decidability. UCNC Martin Kutrib, Matthias Wendlandt
2020	J	`jnl`	Boosting Reversible Pushdown and Queue Machines by Preprocessing. Int. J. Found. Comput. Sci. Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2019	—	`conf`	Informatikunterricht - Ein Muss zur politischen Mündigkeit. INFOS Niko Hausner, Katharina Wendlandt, Matthias Wendlandt
2019	C	`conf`	Input-Driven Multi-counter Automata. CIAA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2019	B	`conf`	Multi-stranded String Assembling Systems. SOFSEM Martin Kutrib, Matthias Wendlandt
2019	J	`jnl`	Transducing reversibly with finite state machines. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2018	C	`conf`	Boosting Pushdown and Queue Machines by Preprocessing. CIAA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2018	J	`jnl`	Descriptional complexity of limited automata. Inf. Comput. Martin Kutrib, Giovanni Pighizzini, Matthias Wendlandt
2018	J	`jnl`	Diving into the queue. RAIRO Theor. Informatics Appl. Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2018	J	`jnl`	Expressive capacity of subregular expressions. RAIRO Theor. Informatics Appl. Martin Kutrib, Matthias Wendlandt
2018	C	`conf`	Parametrizing String Assembling Systems. CIAA Martin Kutrib, Matthias Wendlandt
2018	—	`ch.`	Queue Automata: Foundations and Developments. Reversibility and Universality Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2017	—	`conf`	Algorithmisieren im Grundschulalter. INFOS Sabrina Hoffmann, Katharina Wendlandt, Matthias Wendlandt
2017	J	`jnl`	Concatenation-free languages. Theor. Comput. Sci. Martin Kutrib, Matthias Wendlandt
2017	J	`jnl`	Descriptional Complexity of Bounded Regular Languages. J. Autom. Lang. Comb. Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2017	—	`conf`	Fast One-Way Cellular Automata with Reversible Mealy Cells. AUTOMATA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2017	—	`conf`	Input-Driven Double-Head Pushdown Automata. AFL Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2017	J	`jnl`	Reversible Limited Automata. Fundam. Informaticae Martin Kutrib, Matthias Wendlandt
2017	—	`conf`	Self-verifying pushdown automata. NCMA Henning Fernau, Martin Kutrib, Matthias Wendlandt
2017	J	`jnl`	Shrinking one-way cellular automata. Nat. Comput. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2017	J	`jnl`	Tinput-Driven Pushdown, Counter, and Stack Automata. Fundam. Informaticae Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2017	C	`conf`	Transducing Reversibly with Finite State Machines. CIAA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2016	C	`conf`	Boosting Reversible Pushdown Machines by Preprocessing. RC Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2016	—	`conf`	Descriptional Complexity of Bounded Regular Languages. DCFS Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2016	—	`conf`	Diving into the queue. NCMA Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2016	—	`conf`	Expressive capacity of subregular expressions. NCMA Martin Kutrib, Matthias Wendlandt
2016	C	`conf`	Input-Driven Queue Automata with Internal Transductions. LATA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2016	J	`jnl`	On the Computational Complexity of Partial Word Automata Problems. Fundam. Informaticae Markus Holzer, Sebastian Jakobi, Matthias Wendlandt
2016	J	`jnl`	Reversible Queue Automata. Fundam. Informaticae Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2016	J	`jnl`	Set Automata. Int. J. Found. Comput. Sci. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2016	J	`jnl`	When input-driven pushdown automata meet reversiblity. RAIRO Theor. Informatics Appl. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2015	J	`jnl`	Deterministic One-Way Turing Machines with Sublinear Space. Fundam. Informaticae Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt
2015	J	`jnl`	Deterministic input-driven queue automata: Finite turns, decidability, and closure properties. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt
2015	C	`conf`	Expressive Capacity of Concatenation Freeness. CIAA Martin Kutrib, Matthias Wendlandt
2015	—	`conf`	On Simulation Cost of Unary Limited Automata. DCFS Martin Kutrib, Matthias Wendlandt
2015	C	`conf`	Reversible Limited Automata. MCU Martin Kutrib, Matthias Wendlandt
2015	C	`conf`	Reversible Ordered Restarting Automata. RC Friedrich Otto, Matthias Wendlandt, Kent Kwee
2015	—	`conf`	Shrinking One-Way Cellular Automata. Automata Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2015	C	`conf`	Tinput-Driven Pushdown Automata. MCU Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2015	—	`conf`	When input-driven pushdown automata meet reversibility. NCMA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2014	J	`jnl`	Bidirectional string assembling systems. RAIRO Theor. Informatics Appl. Martin Kutrib, Matthias Wendlandt
2014	C	`conf`	Deterministic Set Automata. Developments in Language Theory Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2014	J	`jnl`	Head and state hierarchies for unary multi-head finite automata. Acta Informatica Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2014	J	`jnl`	Nonterminal Controlled String Assembling Systems. J. Autom. Lang. Comb. Henning Bordihn, Martin Kutrib, Matthias Wendlandt
2014	—	`conf`	On the computational complexity of partial word automata problems. NCMA Markus Holzer, Sebastian Jakobi, Matthias Wendlandt
2014	B	`conf`	Parameterized Prefix Distance between Regular Languages. SOFSEM Martin Kutrib, Katja Meckel, Matthias Wendlandt
2014	—	`conf`	Real-Time Reversible One-Way Cellular Automata. Automata Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2014	—	`conf`	Regularity and Size of Set Automata. DCFS Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2014	—	`conf`	Reversible queue automata. NCMA Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2014	J	`jnl`	Simulations of Unary One-Way Multi-Head Finite Automata. Int. J. Found. Comput. Sci. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2014	J	`jnl`	Stateless One-Way Multi-Head Finite Automata with Pebbles. Int. J. Found. Comput. Sci. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2013	—	`conf`	Deterministic one-way Turing machines with sublinear space bounds. NCMA Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt
2013	C	`conf`	Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. CIAA Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt
2013	C	`conf`	One-Way Multi-Head Finite Automata with Pebbles But No States. Developments in Language Theory Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2013	—	`conf`	Size of Unary One-Way Multi-head Finite Automata. DCFS Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2012	—	`conf`	Bidirectional String Assembling Systems. NCMA Martin Kutrib, Matthias Wendlandt
2012	C	`conf`	States and Heads Do Count for Unary Multi-head Finite Automata. Developments in Language Theory Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2012	J	`jnl`	String Assembling Systems. RAIRO Theor. Informatics Appl. Martin Kutrib, Matthias Wendlandt
2011	—	`conf`	String Assembling Systems. NCMA Martin Kutrib, Matthias Wendlandt
2007	—	`—`	Formalsprachliche Aspekte von XML. Matthias Wendlandt