Matthias Wendlandt

发表

Input-Driven DoubleHead Pushdown Automata

M. Holzer, Martin Kutrib, Andreas Malcher, 2017 .

Self-verifying pushdown automata

Henning Fernau, Martin Kutrib, Matthias Wendlandt, 2017, NCMA.

Descriptional Complexity of Bounded Regular Languages

Martin Kutrib, Andreas Malcher, Andrea Herrmann, 2017, J. Autom. Lang. Comb..

Reversible Queue Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2016, Fundam. Informaticae.

String Assembling Systems: Comparison to Sticker Systems and Decidability

Martin Kutrib, Matthias Wendlandt, Martin Kutrib, 2021, UCNC.

Set Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2016, Int. J. Found. Comput. Sci..

Tinput-Driven Pushdown, Counter, and Stack Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2017, Fundam. Informaticae.

Boosting Reversible Pushdown and Queue Machines by Preprocessing

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2020, Int. J. Found. Comput. Sci..

Nonterminal Controlled String Assembling Systems

Martin Kutrib, Matthias Wendlandt, Henning Bordihn, 2014, J. Autom. Lang. Comb..

State Complexity of Partial Word Finite Automata

Martin Kutrib, Matthias Wendlandt, Martin Kutrib, 2021, DCFS.

Variants of string assembling systems

Martin Kutrib, Matthias Wendlandt, 2022, Natural Computing.

Deterministic input-driven queue automata: Finite turns, decidability, and closure properties

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2015, Theor. Comput. Sci..

Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2013, CIAA.

Concatenation-free languages

Martin Kutrib, Matthias Wendlandt, Martin Kutrib, 2017, Theor. Comput. Sci..

Expressive capacity of subregular expressions

Martin Kutrib, Matthias Wendlandt, Martin Kutrib, 2018, NCMA.

Expressive Capacity of Concatenation Freeness

Martin Kutrib, Matthias Wendlandt, Martin Kutrib, 2015, CIAA.

Queue Automata: Foundations and Developments

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2018, Reversibility and Universality.

Deterministic Set Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2014, Developments in Language Theory.

Multi-stranded String Assembling Systems

Martin Kutrib, Matthias Wendlandt, Martin Kutrib, 2019, SOFSEM.

Stateless One-Way Multi-Head Finite Automata with Pebbles

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2014, Int. J. Found. Comput. Sci..

Head and state hierarchies for unary multi-head finite automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2014, Acta Informatica.

One-Way Multi-Head Finite Automata with Pebbles But No States

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2013, Developments in Language Theory.

States and Heads Do Count for Unary Multi-head Finite Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2012, Developments in Language Theory.

Descriptional Complexity of Formal Systems

H Germany, France., Finland., 2016, Lecture Notes in Computer Science.

Diving into the queue

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2018, NCMA.

Tinput-Driven Pushdown Automata

Martin Kutrib, Andreas Malcher, Matthias Wendlandt, 2015, MCU.

Parameterized Prefix Distance between Regular Languages

Martin Kutrib, Katja Meckel, Matthias Wendlandt, 2014, SOFSEM.