Martin Kutrib

ORCID

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 125

Top Venues

Int. J. Found. Comput. Sci.

NCMA

CIAA

DCFS

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

Education History

University of Giessen, Gießen, Germany

PHD

Publications

Martin Kutrib, Matthias Wendlandt
Variants of string assembling systems. Nat. Comput. 23 (1) (2024)
Martin Kutrib, Andreas Malcher
Reversible Computations of One-Way Counter Automata. RAIRO Theor. Informatics Appl. 58 (2024)
Martin Kutrib, Andreas Malcher
Cellular Automata: Communication Matters. CiE (2024)
Martin Kutrib, Andreas Malcher
Cellular Automata: From Black-and-White to High Gloss Color. DLT (2024)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
On the power of pushing or stationary moves for input-driven pushdown automata. Theor. Comput. Sci. 996 (2024)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt
Deterministic Pushdown Automata with Translucent Input Letters. DLT (2024)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated uniform finite-state transducers on unary languages. Theor. Comput. Sci. 969 (2023)
Martin Kutrib, Uwe Meyer
Syntax checking either way. Theor. Comput. Sci. (2023)
Martin Kutrib
Sweeping Input-Driven Pushdown Automata. CIAA (2023)
Martin Kutrib, Uwe Meyer
Reversible Top-Down Syntax Analysis. Int. J. Found. Comput. Sci. 34 (2&3) (2023)
Martin Kutrib, Uwe Meyer
Tree-Walking-Storage Automata. DLT (2023)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. J. Autom. Lang. Comb. 28 (1-3) (2023)
Jürgen Dassow, Martin Kutrib, Giovanni Pighizzini
25 Editions of DCFS: Origins and Directions. Bull. EATCS 141 (2023)
Martin Kutrib, Andreas Malcher
Reversible Two-Party Computations. AFL (2023)
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, Uwe Meyer
Deterministic Real-Time Tree-Walking-Storage Automata. NCMA (2023)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
On the Power of Pushing or Stationary Moves for Input-Driven Pushdown Automata. CIAA (2022)
Niklas Deworetzki, Martin Kutrib, Uwe Meyer, Pia-Doreen Ritzke
Optimizing Reversible Programs. RC (2022)
Martin Kutrib, Andreas Malcher
One-dimensional pattern generation by cellular automata. Nat. Comput. 21 (3) (2022)
Martin Kutrib, Matthias Wendlandt
State Complexity of Finite Partial Languages. DCFS (2022)
Holger Bock Axelsen, Martin Kutrib, Andreas Malcher
Reversible Shrinking Two-Pushdown Automata. J. Autom. Lang. Comb. 27 (1-3) (2022)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. Fundam. Informaticae 185 (4) (2022)
Martin Kutrib
Iterative arrays with self-verifying communication cell. Nat. Comput. 21 (1) (2022)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Descriptional complexity of iterated uniform finite-state transducers. Inf. Comput. 284 (2022)
Martin Kutrib, Uwe Meyer
Syntax Checking Either Way. CIAA (2022)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. CoRR (2022)
Martin Kutrib, Andreas Malcher, Christian Schneider
Finite automata with undirected state graphs. Acta Informatica 59 (1) (2022)
Martin Kutrib, Andreas Malcher
Iterative arrays with finite inter-cell communication. Nat. Comput. 21 (1) (2022)
Martin Kutrib, Andreas Malcher
Reversible Computations of One-Way Counter Automata. NCMA (2022)
Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Input-Driven Double-Head Pushdown Automata. Int. J. Found. Comput. Sci. 33 (3&4) (2022)
Markus Holzer, Martin Kutrib, Friedrich Otto
Two-Sided Strictly Locally Testable Languages. Fundam. Informaticae 180 (1-2) (2021)
Martin Kutrib, Andreas Malcher
Digging input-driven pushdown automata. RAIRO Theor. Informatics Appl. 55 (2021)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Input-driven multi-counter automata. Theor. Comput. Sci. 870 (2021)
Martin Kutrib, Andreas Malcher
String Generation by Cellular Automata. Complex Syst. 30 (2) (2021)
Martin Kutrib, Luca Prigioniero
Boolean Kernels of Context-Free Languages. CIAA (2021)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated Uniform Finite-State Transducers on Unary Languages. SOFSEM (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)
Martin Kutrib, Uwe Meyer
Reversible Top-Down Syntax Analysis. DLT (2021)
Markus Holzer, Martin Kutrib
Preface. Int. J. Found. Comput. Sci. 32 (5) (2021)
Martin Kutrib, Uwe Meyer, Niklas Deworetzki, Marc Schuster
Compiling Janus to RSSA. RC (2021)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated Transduction on Unary Languages. ICTCS (2021)
Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero
Reversible pushdown transducers. Inf. Comput. 281 (2021)
Henning Fernau, Martin Kutrib, Matthias Wendlandt
Self-Verifying Pushdown and Queue Automata. Fundam. Informaticae 180 (1-2) (2021)
Martin Kutrib, Andreas Malcher
One-Dimensional Pattern Generation by Cellular Automata. ACRI (2020)
Markus Holzer, Martin Kutrib
Automata That May Change Their Mind. J. Autom. Lang. Comb. 25 (2-3) (2020)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power. CiE (2020)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. DCFS (2020)
Martin Kutrib, Friedrich Otto
On Two-Sided Locally Testable Languages. J. Autom. Lang. Comb. 25 (2-3) (2020)
Martin Kutrib, Thomas Worsch
Self-Verifying Cellular Automata. J. Cell. Autom. 15 (3) (2020)
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
Cellular String Generators. Automata (2020)
Martin Kutrib
Kernels of Sub-classes of Context-Free Languages. SOFSEM (2020)
Jan M. Baetens, Martin Kutrib
Preface. Nat. Comput. 19 (4) (2020)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated Uniform Finite-State Transducers. ICTCS (2019)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Transducing reversibly with finite state machines. Theor. Comput. Sci. 787 (2019)
Martin Kutrib, Thomas Worsch
Iterative Arrays with Self-verifying Communication Cell. Automata (2019)
Martin Kutrib, Andreas Malcher
Iterative Arrays with Finite Inter-cell Communication. Automata (2019)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Descriptional Complexity of Iterated Uniform Finite-State Transducers. DCFS (2019)
Simon Beier, Markus Holzer, Martin Kutrib
Operational State Complexity and Decidability of Jumping Finite Automata. Int. J. Found. Comput. Sci. 30 (1) (2019)
Martin Kutrib, Andreas Malcher
Digging input-driven pushdown automata. NCMA (2019)
Markus Holzer, Martin Kutrib
Non-Recursive Trade-Offs Are "Almost Everywhere". CiE (2019)
Martin Kutrib, Matthias Wendlandt
Multi-stranded String Assembling Systems. SOFSEM (2019)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Input-Driven Multi-counter Automata. CIAA (2019)
Markus Holzer, Martin Kutrib
One-Time Nondeterministic Computations. Int. J. Found. Comput. Sci. 30 (6-7) (2019)
Martin Kutrib, Matthias Wendlandt
Parametrizing String Assembling Systems. CIAA (2018)
Markus Holzer, Martin Kutrib
Automata that may change their mind. NCMA (2018)
Martin Kutrib, Thomas Worsch
Self-verifying Cellular Automata. ACRI (2018)
Martin Kutrib, Andreas Malcher, Christian Schneider
Finite Automata with Undirected State Graphs. DCFS (2018)
Antonios Dimitriadis, Martin Kutrib, Georgios Ch. Sirakoulis
Revisiting the cutting of the firing squad synchronization. Nat. Comput. 17 (3) (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)
Markus Holzer, Sebastian Jakobi, Martin Kutrib
Minimal Reversible Deterministic Finite Automata. Int. J. Found. Comput. Sci. 29 (2) (2018)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Boosting Pushdown and Queue Machines by Preprocessing. CIAA (2018)
Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero
Reversible Pushdown Transducers. DLT (2018)
Martin Kutrib, Friedrich Otto
Two-sided locally testable languages. NCMA (2018)
Martin Kutrib, Matthias Wendlandt
Concatenation-free languages. Theor. Comput. Sci. 679 (2017)
Suna Bensch, Johanna Björklund, Martin Kutrib
Deterministic Stack Transducers. Int. J. Found. Comput. Sci. 28 (5) (2017)
Simon Beier, Markus Holzer, Martin Kutrib
On the Descriptional Complexity of Operations on Semilinear Sets. AFL (2017)
Markus Holzer, Martin Kutrib, Friedrich Otto
Two-sided strictly locally testable languages. NCMA (2017)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Shrinking one-way cellular automata. Nat. Comput. 16 (3) (2017)
Markus Holzer, Martin Kutrib
One-Time Nondeterministic Computations. DCFS (2017)
Markus Holzer, Sebastian Jakobi, Martin Kutrib
The chop of languages. Theor. Comput. Sci. 682 (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)
Markus Holzer, Martin Kutrib
Reversible Nondeterministic Finite Automata. RC (2017)
Martin Kutrib, Andreas Malcher
One-way reversible multi-head finite automata. Theor. Comput. Sci. 682 (2017)
Simon Beier, Markus Holzer, Martin Kutrib
Operational State Complexity and Decidability of Jumping Finite Automata. DLT (2017)
Holger Bock Axelsen, Markus Holzer, Martin Kutrib
The Degree of Irreversibility in Deterministic Finite Automata. Int. J. Found. Comput. Sci. 28 (5) (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)
Markus Holzer, Martin Kutrib
Structure and Complexity of Some Subregular Language Families. The Role of Theory in Computer Science (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)
Holger Bock Axelsen, Markus Holzer, Martin Kutrib, Andreas Malcher
Reversible Shrinking Two-Pushdown Automata. LATA (2016)
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
Input-Driven Queue Automata with Internal Transductions. LATA (2016)

Martin Kutrib.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Martin Kutrib