Matthias Wendlandt

Publication Activity (10 Years)

Years Active: 2011-2023
Publications (10 Years): 49

Top Venues

CIAA

NCMA

DCFS

Fundam. Informaticae

University of Giessen, Gießen, Germany (PHD)

Education History

University of Giessen, Gießen, Germany

PHD

Publications

Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Complexity of Exclusive Nondeterministic Finite Automata. DCFS (2023)
Martin Kutrib, Matthias Wendlandt
State complexity of finite partial languages. Theor. Comput. Sci. (2023)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
On the Power of Pushing or Stationary Moves for Input-Driven Pushdown Automata. CIAA (2022)
Martin Kutrib, Matthias Wendlandt
State Complexity of Finite Partial Languages. DCFS (2022)
Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Input-Driven Double-Head Pushdown Automata. Int. J. Found. Comput. Sci. 33 (3&4) (2022)
Friedrich Otto, Matthias Wendlandt
Reversibility for stateless ordered RRWW-automata. Acta Informatica 58 (4) (2021)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Input-driven multi-counter automata. Theor. Comput. Sci. 870 (2021)
Martin Kutrib, Matthias Wendlandt
State Complexity of Partial Word Finite Automata. DCFS (2021)
Martin Kutrib, Matthias Wendlandt
String Assembling Systems: Comparison to Sticker Systems and Decidability. UCNC (2021)
Katharina Wendlandt, Matthias Wendlandt
Formale Aspekte endlicher Automaten entdecken. INFOS (2021)
Henning Fernau, Martin Kutrib, Matthias Wendlandt
Self-Verifying Pushdown and Queue Automata. Fundam. Informaticae 180 (1-2) (2021)
Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Boosting Reversible Pushdown and Queue Machines by Preprocessing. Int. J. Found. Comput. Sci. 31 (8) (2020)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Transducing reversibly with finite state machines. Theor. Comput. Sci. 787 (2019)
Martin Kutrib, Matthias Wendlandt
Multi-stranded String Assembling Systems. SOFSEM (2019)
Niko Hausner, Katharina Wendlandt, Matthias Wendlandt
Informatikunterricht - Ein Muss zur politischen Mündigkeit. INFOS (2019)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Input-Driven Multi-counter Automata. CIAA (2019)
Martin Kutrib, Matthias Wendlandt
Parametrizing String Assembling Systems. CIAA (2018)
Martin Kutrib, Matthias Wendlandt
Expressive capacity of subregular expressions. RAIRO Theor. Informatics Appl. 52 (2-3-4) (2018)
Martin Kutrib, Giovanni Pighizzini, Matthias Wendlandt
Descriptional complexity of limited automata. Inf. Comput. 259 (2) (2018)
Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Diving into the queue. RAIRO Theor. Informatics Appl. 52 (2-3-4) (2018)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Boosting Pushdown and Queue Machines by Preprocessing. CIAA (2018)
Martin Kutrib, Matthias Wendlandt
Concatenation-free languages. Theor. Comput. Sci. 679 (2017)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Shrinking one-way cellular automata. Nat. Comput. 16 (3) (2017)
Henning Fernau, Martin Kutrib, Matthias Wendlandt
Self-verifying pushdown automata. NCMA (2017)
Martin Kutrib, Matthias Wendlandt
Reversible Limited Automata. Fundam. Informaticae 155 (1-2) (2017)
Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Descriptional Complexity of Bounded Regular Languages. J. Autom. Lang. Comb. 22 (1-3) (2017)
Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Input-Driven Double-Head Pushdown Automata. AFL (2017)
Sabrina Hoffmann, Katharina Wendlandt, Matthias Wendlandt
Algorithmisieren im Grundschulalter. INFOS (2017)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Tinput-Driven Pushdown, Counter, and Stack Automata. Fundam. Informaticae 155 (1-2) (2017)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Fast One-Way Cellular Automata with Reversible Mealy Cells. AUTOMATA (2017)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Transducing Reversibly with Finite State Machines. CIAA (2017)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
When input-driven pushdown automata meet reversiblity. RAIRO Theor. Informatics Appl. 50 (4) (2016)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Input-Driven Queue Automata with Internal Transductions. LATA (2016)
Markus Holzer, Sebastian Jakobi, Matthias Wendlandt
On the Computational Complexity of Partial Word Automata Problems. Fundam. Informaticae 148 (3-4) (2016)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Reversible Queue Automata. Fundam. Informaticae 148 (3-4) (2016)
Martin Kutrib, Matthias Wendlandt
Expressive capacity of subregular expressions. NCMA (2016)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Set Automata. Int. J. Found. Comput. Sci. 27 (2) (2016)
Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Descriptional Complexity of Bounded Regular Languages. DCFS (2016)
Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Diving into the queue. NCMA (2016)
Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Boosting Reversible Pushdown Machines by Preprocessing. RC (2016)
Martin Kutrib, Matthias Wendlandt
Reversible Limited Automata. MCU (2015)
Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt
Deterministic One-Way Turing Machines with Sublinear Space. Fundam. Informaticae 136 (1-2) (2015)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt
Deterministic input-driven queue automata: Finite turns, decidability, and closure properties. Theor. Comput. Sci. 578 (2015)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
When input-driven pushdown automata meet reversibility. NCMA (2015)
Friedrich Otto, Matthias Wendlandt, Kent Kwee
Reversible Ordered Restarting Automata. RC (2015)
Martin Kutrib, Matthias Wendlandt
Expressive Capacity of Concatenation Freeness. CIAA (2015)
Martin Kutrib, Matthias Wendlandt
On Simulation Cost of Unary Limited Automata. DCFS (2015)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Shrinking One-Way Cellular Automata. Automata (2015)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Tinput-Driven Pushdown Automata. MCU (2015)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Simulations of Unary One-Way Multi-Head Finite Automata. Int. J. Found. Comput. Sci. 25 (7) (2014)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Deterministic Set Automata. Developments in Language Theory (2014)
Markus Holzer, Sebastian Jakobi, Matthias Wendlandt
On the computational complexity of partial word automata problems. NCMA (2014)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Real-Time Reversible One-Way Cellular Automata. Automata (2014)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Reversible queue automata. NCMA (2014)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Head and state hierarchies for unary multi-head finite automata. Acta Informatica 51 (8) (2014)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Regularity and Size of Set Automata. DCFS (2014)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Stateless One-Way Multi-Head Finite Automata with Pebbles. Int. J. Found. Comput. Sci. 25 (8) (2014)
Martin Kutrib, Matthias Wendlandt
Bidirectional string assembling systems. RAIRO Theor. Informatics Appl. 48 (1) (2014)
Henning Bordihn, Martin Kutrib, Matthias Wendlandt
Nonterminal Controlled String Assembling Systems. J. Autom. Lang. Comb. 19 (1-4) (2014)
Martin Kutrib, Katja Meckel, Matthias Wendlandt
Parameterized Prefix Distance between Regular Languages. SOFSEM (2014)
Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt
Deterministic one-way Turing machines with sublinear space bounds. NCMA (2013)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
One-Way Multi-Head Finite Automata with Pebbles But No States. Developments in Language Theory (2013)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Size of Unary One-Way Multi-head Finite Automata. DCFS (2013)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. CIAA (2013)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
States and Heads Do Count for Unary Multi-head Finite Automata. Developments in Language Theory (2012)
Martin Kutrib, Matthias Wendlandt
String Assembling Systems. RAIRO Theor. Informatics Appl. 46 (4) (2012)
Martin Kutrib, Matthias Wendlandt
Bidirectional String Assembling Systems. NCMA (2012)
Martin Kutrib, Matthias Wendlandt
String Assembling Systems. NCMA (2011)

Matthias Wendlandt.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Matthias Wendlandt