| 2025 | DLT | Subregular Expressions with Two Operations. | Martin Kutrib, Priscilla Raucci, Matthias Wendlandt |
| 2024 | CiE | Cellular Automata: Communication Matters. | Martin Kutrib, Andreas Malcher |
| 2024 | DLT | Cellular Automata: From Black-and-White to High Gloss Color. | Martin Kutrib, Andreas Malcher |
| 2024 | DLT | Deterministic Pushdown Automata with Translucent Input Letters. | Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt |
| 2023 | DLT | Tree-Walking-Storage Automata. | Martin Kutrib, Uwe Meyer |
| 2022 | RC | Optimizing Reversible Programs. | Niklas Deworetzki, Martin Kutrib, Uwe Meyer, Pia-Doreen Ritzke |
| 2021 | DLT | Reversible Top-Down Syntax Analysis. | Martin Kutrib, Uwe Meyer |
| 2021 | RC | Compiling Janus to RSSA. | Martin Kutrib, Uwe Meyer, Niklas Deworetzki, Marc Schuster |
| 2021 | SOFSEM | Iterated Uniform Finite-State Transducers on Unary Languages. | Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano |
| 2021 | UC | String Assembling Systems: Comparison to Sticker Systems and Decidability. | Martin Kutrib, Matthias Wendlandt |
| 2020 | CiE | Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power. | Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano |
| 2020 | SOFSEM | Kernels of Sub-classes of Context-Free Languages. | Martin Kutrib |
| 2019 | CiE | Non-Recursive Trade-Offs Are "Almost Everywhere". | Markus Holzer, Martin Kutrib |
| 2019 | SOFSEM | Multi-stranded String Assembling Systems. | Martin Kutrib, Matthias Wendlandt |
| 2018 | DLT | Reversible Pushdown Transducers. | Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero |
| 2017 | DLT | Operational State Complexity and Decidability of Jumping Finite Automata. | Simon Beier, Markus Holzer, Martin Kutrib |
| 2017 | RC | Reversible Nondeterministic Finite Automata. | Markus Holzer, Martin Kutrib |
| 2016 | LATA | Reversible Shrinking Two-Pushdown Automata. | Holger Bock Axelsen, Markus Holzer, Martin Kutrib, Andreas Malcher |
| 2016 | LATA | Input-Driven Queue Automata with Internal Transductions. | Martin Kutrib, Andreas Malcher, Matthias Wendlandt |
| 2016 | RC | Boosting Reversible Pushdown Machines by Preprocessing. | Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt |
| 2015 | DLT | Minimal Reversible Deterministic Finite Automata. | Markus Holzer, Sebastian Jakobi, Martin Kutrib |
| 2015 | MCU | Tinput-Driven Pushdown Automata. | Martin Kutrib, Andreas Malcher, Matthias Wendlandt |
| 2015 | MCU | Reversible Limited Automata. | Martin Kutrib, Matthias Wendlandt |
| 2015 | MFCS | Reversible and Irreversible Computations of Deterministic Finite-State Devices. | Martin Kutrib |
| 2015 | RC | A Hierarchy of Fast Reversible Turing Machines. | Holger Bock Axelsen, Sebastian Jakobi, Martin Kutrib, Andreas Malcher |
| 2014 | CiE | Complexity of Operation Problems. | Martin Kutrib |
| 2014 | DLT | Measuring Communication in Automata Systems - (Invited Paper). | Martin Kutrib, Andreas Malcher |
| 2014 | DLT | Deterministic Set Automata. | Martin Kutrib, Andreas Malcher, Matthias Wendlandt |
| 2014 | LATA | ω-rational Languages: High Complexity Classes vs. Borel Hierarchy. | Enrico Formenti, Markus Holzer, Martin Kutrib, Julien Provillard |
| 2014 | RC | Degrees of Reversibility for DFA and DPDA. | Martin Kutrib, Thomas Worsch |
| 2014 | SOFSEM | Parameterized Prefix Distance between Regular Languages. | Martin Kutrib, Katja Meckel, Matthias Wendlandt |
| 2013 | DLT | One-Way Multi-Head Finite Automata with Pebbles But No States. | Martin Kutrib, Andreas Malcher, Matthias Wendlandt |
| 2013 | RC | Time-Symmetric Machines. | Martin Kutrib, Thomas Worsch |
| 2012 | DLT | States and Heads Do Count for Unary Multi-head Finite Automata. | Martin Kutrib, Andreas Malcher, Matthias Wendlandt |
| 2012 | LATIN | Oblivious Two-Way Finite Automata: Decidability and Complexity. | Martin Kutrib, Andreas Malcher, Giovanni Pighizzini |
| 2012 | RC | One-Way Reversible Multi-head Finite Automata. | Martin Kutrib, Andreas Malcher |
| 2011 | CiE | Nature-Based Problems in Cellular Automata. | Martin Kutrib |
| 2011 | DLT | Nodes Connected by Path Languages. | Markus Holzer, Martin Kutrib, Ursula Leiter |
| 2010 | DLT | Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. | Henning Bordihn, Martin Kutrib, Andreas Malcher |
| 2010 | DLT | The Complexity of Regular(-Like) Expressions. | Markus Holzer, Martin Kutrib |
| 2010 | LATA | Reversible Pushdown Automata. | Martin Kutrib, Andreas Malcher |
| 2009 | LATA | Undecidability of Operation Problems for T0L Languages and Subclasses. | Henning Bordihn, Markus Holzer, Martin Kutrib |
| 2009 | LATA | Descriptional and Computational Complexity of Finite Automata. | Markus Holzer, Martin Kutrib |
| 2009 | SOFSEM | On Stateless Deterministic Restarting Automata. | Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto |
| 2008 | DLT | On the Computational Capacity of Parallel Communicating Finite Automata. | Henning Bordihn, Martin Kutrib, Andreas Malcher |
| 2008 | LATA | Deterministic Input-Reversal and Input-Revolving Finite Automata. | Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib |
| 2007 | DLT | Hairpin Finite Automata. | Henning Bordihn, Markus Holzer, Martin Kutrib |
| 2007 | FCT | Real-Time Reversible Iterative Arrays. | Martin Kutrib, Andreas Malcher |
| 2007 | LATA | Fast Reversible Language Recognition Using Cellular Automata. | Martin Kutrib, Andreas Malcher |
| 2007 | LATA | Succinct Description of Regular Languages by Weak Restarting Automata. | Martin Kutrib, Jens Reimann |
| 2007 | MCU | More on the Size of Higman-Haines Sets: Effective Constructions. | Hermann Gruber, Markus Holzer, Martin Kutrib |
| 2006 | DLT | Context-Dependent Nondeterminism for Pushdown Automata. | Martin Kutrib, Andreas Malcher |
| 2006 | MFCS | Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability. | Martin Kutrib, Andreas Malcher |
| 2005 | DLT | Revolving-Input Finite Automata. | Henning Bordihn, Markus Holzer, Martin Kutrib |
| 2004 | DLT | Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages. | Henning Bordihn, Markus Holzer, Martin Kutrib |
| 2004 | DLT | The Boolean Closure of Linear Context-Free Languages. | Martin Kutrib, Andreas Malcher, Detlef Wotschke |
| 2004 | MCU | Register Complexity of LOOP-, WHILE-, and GOTO-Programs. | Markus Holzer, Martin Kutrib |
| 2003 | DLT | Flip-Pushdown Automata: Nondeterminism Is Better than Determinism. | Markus Holzer, Martin Kutrib |
| 2003 | FCT | Dimension- and Time-Hierarchies for Small Time Bounds. | Martin Kutrib |
| 2003 | ICALP | Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k. | Markus Holzer, Martin Kutrib |
| 2002 | COCOON | Self-Assembling Finite Automata. | Andreas Klein, Martin Kutrib |
| 2002 | DLT | Unary Language Operations and Their Nondeterministic State Complexity. | Markus Holzer, Martin Kutrib |
| 2002 | SOFSEM | String Transformation for n -Dimensional Image Compression. | Martin Kutrib, Jan-Thomas Lwe |
| 2001 | MCU | Efficient Universal Pushdown Cellular Automata and Their Application to Complexity. | Martin Kutrib |
| 2001 | MFCS | A Time Hierarchy for Bounded One-Way Cellular Automata. | Andreas Klein, Martin Kutrib |
| 2000 | DLT | Iterative Arrays With Limited Nondeterministic Communication Cell. | Thomas Buchholz, Andreas Klein, Martin Kutrib |
| 2000 | MFCS | Iterative Arrays with Small Time Bounds. | Thomas Buchholz, Andreas Klein, Martin Kutrib |
| 2000 | SOFSEM | Massively Parallel Pattern Recognition with Link Failures. | Martin Kutrib, Jan-Thomas Lwe |
| 1999 | DLT | On tally languages and generalized interacting automata. | Thomas Buchholz, Andreas Klein, Martin Kutrib |
| 1999 | FCT | Iterative Arrays with a Wee Bit Alternation. | Thomas Buchholz, Andreas Klein, Martin Kutrib |
| 1998 | MFCS | One Guess One-Way Cellular Arrays. | Thomas Buchholz, Andreas Klein, Martin Kutrib |
| 1997 | DLT | On the power of one-way bounded cellular time computers. | Thomas Buchholz, Martin Kutrib |
| 1995 | DLT | Real-Time One-Way Pushdown Cellular Automata Languages. | Martin Kutrib, Jrg Richstein |