| 2024 | DLT | Finite Automata with Sets of Translucent Words. | Benedek Nagy, Friedrich Otto |
| 2020 | SOFSEM | A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata. | Friedrich Otto |
| 2019 | DLT | On Shrinking Restarting Automata of Window Size One and Two. | Frantisek Mrz, Friedrich Otto |
| 2019 | SOFSEM | Two-Head Finite-State Acceptors with Translucent Letters. | Benedek Nagy, Friedrich Otto |
| 2018 | DLT | On Deterministic Ordered Restart-Delete Automata. | Friedrich Otto |
| 2017 | DLT | Deleting Deterministic Restarting Automata with Two Windows. | Frantisek Mrz, Friedrich Otto |
| 2016 | DLT | On Ordered RRWW-Automata. | Kent Kwee, Friedrich Otto |
| 2016 | SOFSEM | On the Effects of Nondeterminism on Ordered Restarting Automata. | Kent Kwee, Friedrich Otto |
| 2015 | DLT | Deterministic Ordered Restarting Automata that Compute Functions. | Friedrich Otto, Kent Kwee |
| 2015 | RC | Reversible Ordered Restarting Automata. | Friedrich Otto, Matthias Wendlandt, Kent Kwee |
| 2015 | SOFSEM | On Visibly Pushdown Trace Languages. | Friedrich Otto |
| 2014 | LATA | Extended Two-Way Ordered Restarting Automata for Picture Languages. | Friedrich Otto, Frantisek Mrz |
| 2014 | SOFSEM | Ordered Restarting Automata for Picture Languages. | Frantisek Mrz, Friedrich Otto |
| 2013 | DLT | New Results on Deterministic Sgraffito Automata. | Daniel Prusa, Frantisek Mrz, Friedrich Otto |
| 2013 | LATA | Asynchronous PC Systems of Pushdown Automata. | Friedrich Otto |
| 2012 | DLT | On Centralized PC Grammar Systems with Context-Sensitive Components. | Friedrich Otto |
| 2012 | LATA | Characterizing the Rational Functions by Restarting Transducers. | Norbert Hundeshagen, Friedrich Otto |
| 2011 | DLT | Characterizing the Regular Languages by Nonforgetting Restarting Automata. | Norbert Hundeshagen, Friedrich Otto |
| 2011 | LATA | Globally Deterministic CD-Systems of Stateless R(1)-Automata. | Benedek Nagy, Friedrich Otto |
| 2011 | SOFSEM | An Automata-Theoretical Characterization of Context-Free Trace Languages. | Benedek Nagy, Friedrich Otto |
| 2010 | DLT | On Lexicalized Well-Behaved Restarting Automata That Are Monotone. | Friedrich Otto, Martin Pltek, Frantisek Mrz |
| 2010 | LATA | CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages. | Benedek Nagy, Friedrich Otto |
| 2010 | SOFSEM | CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions. | Friedrich Otto |
| 2009 | LATA | On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata. | Dana Pardubsk, Martin Pltek, Friedrich Otto |
| 2009 | SOFSEM | On Stateless Deterministic Restarting Automata. | Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto |
| 2008 | LATA | On Alternating Phrase-Structure Grammars. | Etsuro Moriya, Friedrich Otto |
| 2008 | LATA | A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata. | Friedrich Otto, Martin Pltek |
| 2007 | FCT | Strictly Deterministic CD-Systems of Restarting Automata. | Hartmut Messerschmidt, Friedrich Otto |
| 2007 | LATA | On Determinism Versus Non-Determinism for Restarting Automata. | Hartmut Messerschmidt, Friedrich Otto |
| 2007 | LATA | Free Word-Order and Restarting Automata. | Frantisek Mrz, Friedrich Otto, Martin Pltek |
| 2007 | MCU | Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata. | Frantisek Mrz, Friedrich Otto, Martin Pltek |
| 2007 | SOFSEM | Restarting Tree Automata. | Heiko Stamer, Friedrich Otto |
| 2006 | CSR | On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone. | Hartmut Messerschmidt, Friedrich Otto |
| 2006 | DLT | On the Gap-Complexity of Simple RL-Automata. | Frantisek Mrz, Friedrich Otto, Martin Pltek |
| 2005 | DLT | Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols. | Tomasz Jurdzinski, Frantisek Mrz, Friedrich Otto, Martin Pltek |
| 2005 | FCT | Shrinking Multi-pushdown Automata. | Markus Holzer, Friedrich Otto |
| 2005 | MFCS | Shrinking Restarting Automata. | Tomasz Jurdzinski, Friedrich Otto |
| 2004 | DLT | On the Complexity of 2-Monotone Restarting Automata. | Tomasz Jurdzinski, Friedrich Otto, Frantisek Mrz, Martin Pltek |
| 2004 | DLT | On Left-Monotone Deterministic Restarting Automata. | Tomasz Jurdzinski, Friedrich Otto, Frantisek Mrz, Martin Pltek |
| 2003 | DLT | Restarting Automata and Their Relations to the Chomsky Hierarchy. | Friedrich Otto |
| 2001 | DLT | On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy. | Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto |
| 2000 | DLT | Further Results on Restarting Automata. | Gundula Niemann, Friedrich Otto |
| 2000 | ISAAC | Undecidability Results for Monoids with Linear-Time Decidable Word Problems. | Masashi Katsura, Yuji Kobayashi, Friedrich Otto |
| 1999 | COCOON | On S-Regular Prefix-Rewriting Systems and Automatic Structures. | Friedrich Otto |
| 1999 | DLT | Restarting automata, Church-Rosser languages, and representations of r.e. languages. | Gundula Niemann, Friedrich Otto |
| 1998 | FOSSACS | The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages. | Gundula Niemann, Friedrich Otto |
| 1997 | COCOON | A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet. | Yuji Kobayashi, Friedrich Otto, Patrice Sbold |
| 1997 | FCT | FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems. | Friedrich Otto, Andrea Sattler-Klein |
| 1997 | ICALP | The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent. | Paliath Narendran, Friedrich Otto |
| 1997 | MFCS | Repetitiveness of D0L-Languages Is Decidable in Polynomial Time. | Yuji Kobayashi, Friedrich Otto |
| 1995 | STACS | Growing Context-Sensitive Languages and Church-Rosser Languages. | Gerhard Buntrock, Friedrich Otto |
| 1994 | ISSAC | Constructing Canonical Presentations for Subgroups of Context-Free Groups in Polynomial Time (extended abstract). | Robert Cremanns, Friedrich Otto |
| 1992 | ISAAC | Generating Small Convergent Systems Can Be Extremely Hard. | Klaus Madlener, Friedrich Otto, Andrea Sattler-Klein |
| 1992 | ISSAC | Computing Presentations for Subgroups of Context-Free Groups. | Norbert Kuhn, Klaus Madlener, Friedrich Otto |
| 1992 | MFCS | One-Rule Trace-Rewriting Systems and Confluence. | Celia Wrathall, Volker Diekert, Friedrich Otto |
| 1991 | ICALP | A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups. | Klaus Madlener, Paliath Narendran, Friedrich Otto |
| 1991 | STACS | Decidable Sentences for Context-Free Groups. | Klaus Madlener, Friedrich Otto |
| 1990 | CADE | Some Results on Equational Unification. | Paliath Narendran, Friedrich Otto |
| 1990 | ISSAC | A Test for lambda-Confluence for Certain Prefix Rewriting Systems with Applications to the Generalized Word Problem. | Norbert Kuhn, Klaus Madlener, Friedrich Otto |
| 1985 | EuroCrypt | The Verifiability of Two-Party Protocols. | Ronald V. Book, Friedrich Otto |