Finite Complete Rewriting Systems and the Complexity of the Word Problem. - G. Bauer; Friedrich Otto (Acta Informatica, 1984)

The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems is NP-Complete - Paliath Narendran; Friedrich Otto; Karl Winklmann (Inf. Control., 1984)

Finite Complete Rewriting Systems for the Jantzen Monoid and the Greendlinger Group. - Friedrich Otto (Theor. Comput. Sci., 1984)

Some Undecidability Results for Non-Monadic Church-Rosser Thue Systems. - Friedrich Otto (Theor. Comput. Sci., 1984)

The Verifiability of Two-Party Protocols. - Ronald V. Book; Friedrich Otto (EUROCRYPT, 1985)

Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems. - Friedrich Otto (RTA, 1985)

Classes of regular and context-free languages over countably infinite alphabets. - Friedrich Otto (Discret. Appl. Math., 1985)

Cancellation Rules and Extended Word Problems. - Ronald V. Book; Friedrich Otto (Inf. Process. Lett., 1985)

Pseudo-Natural Algorithms for the Word Problem for Finitely Presented Monoids and Groups. - Klaus Madlener; Friedrich Otto (J. Symb. Comput., 1985)

A Note on Thue Systems with a Single Defining Relation. - Friedrich Otto; Celia Wrathall (Math. Syst. Theory, 1985)

On the Security of Name-Stamp Protocols. - Ronald V. Book; Friedrich Otto (Theor. Comput. Sci., 1985)

On the Verifiability of Two-Party Algebraic Protocols. - Ronald V. Book; Friedrich Otto (Theor. Comput. Sci., 1985)

Complexity Results on the Conjugacy Problem for Monoids. - Paliath Narendran; Friedrich Otto (Theor. Comput. Sci., 1985)

On Deciding Whether a Monoid is a Free Monoid or is a Group. - Friedrich Otto (Acta Informatica, 1986)

Church-Rosser Thue Systems that Present Free Monoids. - Friedrich Otto (SIAM J. Comput., 1986)

The Problems of Cyclic Equality and Conjugacy for Finite Complete Rewriting Systems. - Paliath Narendran; Friedrich Otto (Theor. Comput. Sci., 1986)

The Undecidability of Self-Embedding for Finite Semi-Thue and Thue Systems. - Friedrich Otto (Theor. Comput. Sci., 1986)

It is Decidable in Polynomial Time Whether a Monoid Presented by a Finite Weight-Reducing and Confluent Thue System is Torsion-Free. - Paliath Narendran; Friedrich Otto (AAECC, 1987)

Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems. - Klaus Madlener; Friedrich Otto (RTA, 1987)

Some Results about Confluence on a Given Congruence Class. - Friedrich Otto (RTA, 1987)

Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems. - Craig C. Squier; Friedrich Otto (RTA, 1987)

Using String-Rewriting for Solving the Word Problem for Finitely Presented Groups. - Klaus Madlener; Friedrich Otto (Inf. Process. Lett., 1987)

On Deciding the Confluence of a Finite String-Rewriting System on a Given Congruence Class. - Friedrich Otto (J. Comput. Syst. Sci., 1987)

Finite Canonical Rewriting Systems for Congruences Generated by Concurrency Relations. - Friedrich Otto (Math. Syst. Theory, 1987)

Elements of Finite Order for Finite Weight-Reducing and Confluent Thue Systems. - Paliath Narendran; Friedrich Otto (Acta Informatica, 1988)

An example of a one-relator group that is not a one-relation monoid. - Friedrich Otto (Discret. Math., 1988)

Preperfectness is Undecidable for Thue Systems Containing Only Length-Reducing Rules and a Single Commutation Rule. - Paliath Narendran; Friedrich Otto (Inf. Process. Lett., 1988)

Commutativity in Groups Presented By Finite Church-Rosser Thue Systems. - Klaus Madlener; Friedrich Otto (RAIRO Theor. Informatics Appl., 1988)

Church-Rosser Thue systems and formal languages. - Robert McNaughton; Paliath Narendran; Friedrich Otto (J. ACM, 1988)

Pseudo-Natural Algorithms for Finitely Generated Presentations of Monoids and Groups. - Klaus Madlener; Friedrich Otto (J. Symb. Comput., 1988)

Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems. - Friedrich Otto (RTA, 1989)

About the Descriptive Power of Certain Classes of Finite String-Rewriting Systems. - Klaus Madlener; Friedrich Otto (Theor. Comput. Sci., 1989)

Some Polynomial-Time Algorithms for Finite Monadic Church-Rosser Thue Systems. - Paliath Narendran; Friedrich Otto (Theor. Comput. Sci., 1989)

On Deciding Confluence of Finite String-Rewriting Systems Modulo Partial Commutativity. - Friedrich Otto (Theor. Comput. Sci., 1989)

Some Results on Equational Unification. - Paliath Narendran; Friedrich Otto (CADE, 1990)

A Test for lambda-Confluence for Certain Prefix Rewriting Systems with Applications to the Generalized Word Problem. - Norbert Kuhn; Klaus Madlener; Friedrich Otto (ISSAC, 1990)

On Ground-Confluence of Term Rewriting Systems - Deepak Kapur; Paliath Narendran; Friedrich Otto (Inf. Comput., 1990)

Some Undecidability Results for Weakly Confluent Monadic String-Rewriting Systems. - Friedrich Otto (AAECC, 1991)

A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups. - Klaus Madlener; Paliath Narendran; Friedrich Otto (ICALP, 1991)

Decidable Sentences for Context-Free Groups. - Klaus Madlener; Friedrich Otto (STACS, 1991)

Completing a Finite Special String-Rewriting System on the Congruence Class of the Empty Word. - Friedrich Otto (Appl. Algebra Eng. Commun. Comput., 1991)

Decision Problems for Finite Special String-Rewriting Systems that are Confluent on Some Congruence Class. - Friedrich Otto; Louxin Zhang (Acta Informatica, 1991)

It is undecidable whether a finite special string-rewriting system presents a group. - Paliath Narendran; Colm Ó'Dúnlaing; Friedrich Otto (Discret. Math., 1991)

Overlaps in Free Partially Commutative Monoids. - Friedrich Otto; Celia Wrathall (J. Comput. Syst. Sci., 1991)

When is an Extension of a Specification Consistent? Decidable and Undecidable Cases. - Friedrich Otto (J. Symb. Comput., 1991)

Generating Small Convergent Systems Can Be Extremely Hard. - Klaus Madlener; Friedrich Otto; Andrea Sattler-Klein (ISAAC, 1992)

Computing Presentations for Subgroups of Context-Free Groups. - Norbert Kuhn; Klaus Madlener; Friedrich Otto (ISSAC, 1992)

One-Rule Trace-Rewriting Systems and Confluence. - Celia Wrathall; Volker Diekert; Friedrich Otto (MFCS, 1992)

The Problem of Deciding Confluence on a Given Congruence Class is Tractable for Finite Special String-Rewriting Systems. - Friedrich Otto (Math. Syst. Theory, 1992)

String-Rewriting Systems. - Ronald V. Book; Friedrich Otto (Springer, 1993)

On the Problem of Generating Small Convergent Systems. - Klaus Madlener; Andrea Sattler-Klein; Friedrich Otto (J. Symb. Comput., 1993)

Separating the Intrinsic Complexity and the Derivational complexity of the Word Problem for Finitely Presented Groups. - Friedrich Otto; Daniel E. Cohen; Klaus Madlener (Math. Log. Q., 1993)

On Weakly Confluent Monadic String-Rewriting Systems. - Klaus Madlener; Paliath Narendran; Friedrich Otto; Louxin Zhang (Theor. Comput. Sci., 1993)

Constructing Canonical Presentations for Subgroups of Context-Free Groups in Polynomial Time (extended abstract). - Robert Cremanns; Friedrich Otto (ISSAC, 1994)

Computing Presentations for Subgroups of Polycyclic Groups and of Context-Free Groups. - Norbert Kuhn; Klaus Madlener; Friedrich Otto (Appl. Algebra Eng. Commun. Comput., 1994)

Finite Derivation Type Implies the Homological Finiteness Condition FP_3. - Robert Cremanns; Friedrich Otto (J. Symb. Comput., 1994)

Codes Modulo Finite Monadic String-Rewriting Systems. - Friedrich Otto; Paliath Narendran (Theor. Comput. Sci., 1994)

A Finiteness Condition for Rewriting Systems. - Craig C. Squier; Friedrich Otto; Yuji Kobayashi (Theor. Comput. Sci., 1994)

Some Independent Results for Equational Unification. - Friedrich Otto; Paliath Narendran; Daniel J. Dougherty (RTA, 1995)

Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General. - Friedrich Otto (Inf. Process. Lett., 1995)

On Confluence Versus Strong Confluence for One-Rule Trace-Rewriting Systems. - Friedrich Otto (Math. Syst. Theory, 1995)

For Groups the Property of Having Finite Derivation Type is Equivalent to the Homological Finiteness Condition FP_3. - Robert Cremanns; Friedrich Otto (J. Symb. Comput., 1996)

Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems - A Survey. - Friedrich Otto; Yuji Kobayashi (Advances in Algorithms, Languages, and Complexity, 1997)

A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet. - Yuji Kobayashi; Friedrich Otto; Patrice Séébold (COCOON, 1997)

FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems. - Friedrich Otto; Andrea Sattler-Klein (FCT, 1997)

The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent. - Paliath Narendran; Friedrich Otto (ICALP, 1997)

Repetitiveness of D0L-Languages Is Decidable in Polynomial Time. - Yuji Kobayashi; Friedrich Otto (MFCS, 1997)

On the Property of Preserving Regularity for String-Rewriting Systems. - Friedrich Otto (RTA, 1997)

Cross-Sections for Finitely Presented Monoids with Decidable Word Problems. - Friedrich Otto; Masashi Katsura; Yuji Kobayashi (RTA, 1997)

Some Undecidability Results for Finitely Generated Thue Congruences on aTwo-Letter Alphabet. - Klaus Madlener; Friedrich Otto (Fundam. Informaticae, 1997)

Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories. - Paliath Narendran; Friedrich Otto (J. Autom. Reason., 1997)

Automatic Monoids Versus Monoids with Finite Convergent Presentations. - Friedrich Otto; Andrea Sattler-Klein; Klaus Madlener (RTA, 1998)

Growing Context-Sensitive Languages and Church-Rosser Languages. - Gerhard Buntrock; Friedrich Otto (Inf. Comput., 1998)

Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented Monoids. - Friedrich Otto; Masashi Katsura; Yuji Kobayashi (J. Symb. Comput., 1998)

Some Undecidability Results Concerning the Property of Preserving Regularity. - Friedrich Otto (Theor. Comput. Sci., 1998)

Equational Unification, Word Unification, and 2nd-Order Equational Unification. - Friedrich Otto; Paliath Narendran; Daniel J. Dougherty (Theor. Comput. Sci., 1998)

On S-Regular Prefix-Rewriting Systems and Automatic Structures. - Friedrich Otto (COCOON, 1999)

Restarting automata, Church-Rosser languages, and representations of r.e. languages. - Gundula Niemann; Friedrich Otto (Developments in Language Theory, 1999)

On the Connections between Rewriting and Formal Language Theory. - Friedrich Otto (RTA, 1999)

Confluent Internal Contextual Languages. - Gundula Niemann; Friedrich Otto (Recent Topics in Mathematical and Computational Linguistics, 2000)

Further Results on Restarting Automata. - Gundula Niemann; Friedrich Otto (Words, Languages & Combinatorics, 2000)

Undecidability Results for Monoids with Linear-Time Decidable Word Problems. - Masashi Katsura; Yuji Kobayashi; Friedrich Otto (ISAAC, 2000)

The Property Fdt is Undecidable for Finitely Presented Monoids that Have Polynomial-Time Decidable Word Problems. - Friedrich Otto; Andrea Sattler-Klein (Int. J. Algebra Comput., 2000)

On Dehn Functions of Finitely Presented Bi-Automatic Monoids. - Friedrich Otto (J. Autom. Lang. Comb., 2000)

Repetitiveness of languages generated by morphisms. - Yuji Kobayashi; Friedrich Otto (Theor. Comput. Sci., 2000)

On the Power of RRWW-Automata. - Gundula Niemann; Friedrich Otto (Words, Semigroups, and Transductions, 2001)

On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy. - Martin Beaudry; Markus Holzer 001; Gundula Niemann; Friedrich Otto (Developments in Language Theory, 2001)

On Homotopical and Homological Finiteness Conditions for Finitely Presented Monoids. - Yuji Kobayashi; Friedrich Otto (Int. J. Algebra Comput., 2001)

Confluent Monadic String-Rewriting Systems and Automatic Structures. - Friedrich Otto; Nikola Ruskuc (J. Autom. Lang. Comb., 2001)

Some Exact Sequences for The Homotopy (Bi-)Module af A Monoid. - Yuji Kobayashi; Friedrich Otto (Int. J. Algebra Comput., 2002)

A Completion Procedure for Finitely Presented Groups That Is Based on Word Cycles. - Robert Cremanns; Friedrich Otto (J. Autom. Reason., 2002)

Church-Rosser Languages and Their Relationship to Other Language Classes. - Gundula Niemann; Friedrich Otto (Grammars and Automata for String Processing, 2003)

Restarting Automata and Variants of j-Monotonicity. - Martin Plátek; Friedrich Otto; Frantisek Mráz (DCFS, 2003)

Restarting Automata and Their Relations to the Chomsky Hierarchy. - Friedrich Otto (Developments in Language Theory, 2003)

McNaughton families of languages. - Martin Beaudry; Markus Holzer 001; Gundula Niemann; Friedrich Otto (Theor. Comput. Sci., 2003)

Undecidable properties of monoids with word problem solvable in linear time. Part II– cross sections and homological and homotopical finiteness conditions. - Masashi Katsura; Yuji Kobayashi; Friedrich Otto (Theor. Comput. Sci., 2003)

On Left-Monotone Deterministic Restarting Automata. - Tomasz Jurdzinski; Friedrich Otto; Frantisek Mráz; Martin Plátek (Developments in Language Theory, 2004)

On Oleshchuk's Public Key Cryptosystem. - Heiko Stamer; Friedrich Otto (IACR Cryptol. ePrint Arch., 2004)

Shrinking Alternating Two-Pushdown Automata. - Friedrich Otto; Etsuro Moriya (IEICE Trans. Inf. Syst., 2004)

Some Results on RWW- and RRWW-Automata and their Relation to the Class of Growing Context-Sensitive Languages. - Tomasz Jurdzinski; Krzysztof Lorys; Gundula Niemann; Friedrich Otto (J. Autom. Lang. Comb., 2004)

Reduction relations for monoid semirings. - Friedrich Otto; Olga Sokratova (J. Symb. Comput., 2004)

Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols. - Tomasz Jurdzinski; Frantisek Mráz; Friedrich Otto; Martin Plátek (Developments in Language Theory, 2005)

Shrinking Multi-pushdown Automata. - Markus Holzer 001; Friedrich Otto (FCT, 2005)

Restricting the Use of Auxiliary Symbols for Restarting Automata. - Tomasz Jurdzinski; Friedrich Otto (CIAA, 2005)

Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars. - Tomasz Jurdzinski; Friedrich Otto; Frantisek Mráz; Martin Plátek (Fundam. Informaticae, 2005)

The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. - Gundula Niemann; Friedrich Otto (Inf. Comput., 2005)

Hierarchies of weakly monotone restarting automata. - Frantisek Mráz; Friedrich Otto (RAIRO Theor. Informatics Appl., 2005)

On state-alternating context-free grammars. - Etsuro Moriya; Dieter Hofbauer; Maria Huber; Friedrich Otto (Theor. Comput. Sci., 2005)

On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone. - Hartmut Messerschmidt; Friedrich Otto (CSR, 2006)

On the Gap-Complexity of Simple RL-Automata. - Frantisek Mráz; Friedrich Otto; Martin Plátek (Developments in Language Theory, 2006)

Learning Analysis by Reduction from Positive Data. - Frantisek Mráz; Friedrich Otto; Martin Plátek (ICGI, 2006)

Correctness Preservation and Complexity of Simple RL-Automata. - Hartmut Messerschmidt; Frantisek Mráz; Friedrich Otto; Martin Plátek (CIAA, 2006)

Degrees of non-monotonicity for restarting automata. - Tomasz Jurdzinski; Frantisek Mráz; Friedrich Otto; Martin Plátek (Theor. Comput. Sci., 2006)

Restarting automata with restricted utilization of auxiliary symbols. - Tomasz Jurdzinski; Friedrich Otto (Theor. Comput. Sci., 2006)

Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata. - Frantisek Mráz; Friedrich Otto; Martin Plátek; Tomasz Jurdzinski (Theor. Comput. Sci., 2006)

Restarting Automata. - Friedrich Otto (Recent Advances in Formal Languages and Applications, 2006)

Restarting Tree Automata and Linear Context-Free Tree Languages. - Heiko Stamer; Friedrich Otto (CAI, 2007)

Strictly Deterministic CD-Systems of Restarting Automata. - Hartmut Messerschmidt; Friedrich Otto (FCT, 2007)

On Determinism Versus Non-Determinism for Restarting Automata. - Hartmut Messerschmidt; Friedrich Otto (LATA, 2007)

Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata. - Frantisek Mráz; Friedrich Otto; Martin Plátek (MCU, 2007)

Restarting Tree Automata. - Heiko Stamer; Friedrich Otto (SOFSEM (1), 2007)

A Measure for the Degree of Nondeterminism of Context-Free Languages. - Frantisek Mráz; Martin Plátek; Friedrich Otto (CIAA, 2007)

Two Ways of Introducing Alternation into Context-Free Grammars and Pushdown Automata. - Etsuro Moriya; Friedrich Otto (IEICE Trans. Inf. Syst., 2007)

Shrinking Restarting Automata. - Tomasz Jurdzinski; Friedrich Otto (Int. J. Found. Comput. Sci., 2007)

Cooperating Distributed Systems of Restarting Automata. - Hartmut Messerschmidt; Friedrich Otto (Int. J. Found. Comput. Sci., 2007)

Sequential monotonicity for restarting automata. - Tomasz Jurdzinski; Friedrich Otto (RAIRO Theor. Informatics Appl., 2007)

On PCGS and FRR-automata. - Dana Pardubská; Martin Plátek; Friedrich Otto (ITAT, 2008)

A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata. - Friedrich Otto; Martin Plátek (LATA, 2008)

On determinism versus nondeterminism for restarting automata. - Hartmut Messerschmidt; Friedrich Otto (Inf. Comput., 2008)

Church-Rosser Groups and Growing Context-Sensitive Groups. - Mark Kambites; Friedrich Otto (J. Autom. Lang. Comb., 2008)

On the Complexity of 2-Monotone Restarting Automata. - Tomasz Jurdzinski; Friedrich Otto; Frantisek Mráz; Martin Plátek (Theory Comput. Syst., 2008)

Single-Path Restarting Tree Automata. - Friedrich Otto; Heiko Stamer (CAI, 2009)

Parallel Communicating Grammar Systems with Regular Control. - Dana Pardubská; Martin Plátek; Friedrich Otto (CAI, 2009)

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata. - Dana Pardubská; Martin Plátek; Friedrich Otto (LATA, 2009)

Two-dimensional hierarchies of proper languages of lexicalized FRR-automata. - Martin Plátek; Friedrich Otto; Frantisek Mráz (Inf. Comput., 2009)

On Deterministic CD-Systems of Restarting Automata. - Hartmut Messerschmidt; Friedrich Otto (Int. J. Found. Comput. Sci., 2009)

Left-to-right regular languages and two-way restarting automata. - Friedrich Otto (RAIRO Theor. Informatics Appl., 2009)

The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages. - Frantisek Mráz; Friedrich Otto; Martin Plátek (Theor. Comput. Sci., 2009)

On Lexicalized Well-Behaved Restarting Automata That Are Monotone. - Friedrich Otto; Martin Plátek; Frantisek Mráz (Developments in Language Theory, 2010)

CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages. - Benedek Nagy; Friedrich Otto (LATA, 2010)

On McNaughton Families of Languages Specified by Certain Variants of Monadic String-Rewriting Systems. - Peter Leupold; Friedrich Otto (NCMA, 2010)

CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions. - Friedrich Otto (SOFSEM, 2010)

Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata. - Norbert Hundeshagen; Friedrich Otto; Marcel Vollweiler (CIAA, 2010)

On stateless deterministic restarting automata. - Martin Kutrib; Hartmut Messerschmidt; Friedrich Otto (Acta Informatica, 2010)

On Stateless Two-Pushdown Automata and Restarting Automata. - Martin Kutrib; Hartmut Messerschmidt; Friedrich Otto (Int. J. Found. Comput. Sci., 2010)

On Alternating Phrase-Structure Grammars. - Etsuro Moriya; Friedrich Otto (Int. J. Found. Comput. Sci., 2010)

On Restarting Automata with Window Size One. - Friedrich Otto (DCFS, 2011)

Characterizing the Regular Languages by Nonforgetting Restarting Automata. - Norbert Hundeshagen; Friedrich Otto (Developments in Language Theory, 2011)

Globally Deterministic CD-Systems of Stateless R(1)-Automata. - Benedek Nagy; Friedrich Otto (LATA, 2011)

Pushdown Automata with Translucent Pushdown Symbols. - Benedek Nagy; Friedrich Otto; Marcel Vollweiler (NCMA, 2011)

An Automata-Theoretical Characterization of Context-Free Trace Languages. - Benedek Nagy; Friedrich Otto (SOFSEM, 2011)

Preface. - Henning Bordihn; Rudolf Freund; Mika Hirvensalo; Markus Holzer 001; Martin Kutrib; Friedrich Otto (Fundam. Informaticae, 2011)

On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems. - Peter Leupold; Friedrich Otto (Fundam. Informaticae, 2011)

CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store. - Benedek Nagy; Friedrich Otto (RAIRO Theor. Informatics Appl., 2011)

A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata. - Hartmut Messerschmidt; Friedrich Otto (Theory Comput. Syst., 2011)

Parallel communicating grammar systems with regular control and skeleton preserving FRR automata. - Dana Pardubská; Martin Plátek; Friedrich Otto (Theor. Comput. Sci., 2011)

On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata. - Martin Kutrib; Friedrich Otto (Languages Alive, 2012)

Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata. - Friedrich Otto (DCFS, 2012)

On Centralized PC Grammar Systems with Context-Sensitive Components. - Friedrich Otto (Developments in Language Theory, 2012)

Characterizing the Rational Functions by Restarting Transducers. - Norbert Hundeshagen; Friedrich Otto (LATA, 2012)

Limited Context Restarting Automata and McNaughton Families of Languages. - Friedrich Otto; Peter Cerno; Frantisek Mráz (NCMA, 2012)

On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata. - Martin Kutrib; Friedrich Otto (CIAA, 2012)

Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011). - Rudolf Freund; Markus Holzer 001; Carlo Mereghetti; Friedrich Otto; Beatrice Palano (RAIRO Theor. Informatics Appl., 2012)

On CD-systems of stateless deterministic R-automata with window size one. - Benedek Nagy; Friedrich Otto (J. Comput. Syst. Sci., 2012)

New Results on Deterministic Sgraffito Automata. - Daniel Prusa; Frantisek Mráz; Friedrich Otto (Developments in Language Theory, 2013)

Asynchronous PC Systems of Pushdown Automata. - Friedrich Otto (LATA, 2013)

Lambda-Confluence Is Undecidable for Clearing Restarting Automata. - Frantisek Mráz; Friedrich Otto (CIAA, 2013)

Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata. - Daniel Prusa; Frantisek Mráz; Friedrich Otto (CIAA, 2013)

Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata. - Benedek Nagy; Friedrich Otto (Acta Informatica, 2013)

Globally deterministic CD-systems of stateless R-automata with window size 1. - Benedek Nagy; Friedrich Otto (Int. J. Comput. Math., 2013)

On the Descriptional Complexity of the Window Size for Deleting Restarting Automata. - Martin Kutrib; Friedrich Otto (Int. J. Found. Comput. Sci., 2013)

On Centralized Parallel Communicating Grammar Systems with Context-Sensitive Components. - Friedrich Otto (Int. J. Found. Comput. Sci., 2013)

On the Descriptional Complexity of Deterministic Ordered Restarting Automata. - Friedrich Otto (DCFS, 2014)

Extended Two-Way Ordered Restarting Automata for Picture Languages. - Friedrich Otto; Frantisek Mráz (LATA, 2014)

Ordered Restarting Automata for Picture Languages. - Frantisek Mráz; Friedrich Otto (SOFSEM, 2014)

Restarting Automata for Picture Languages: A Survey on Recent Developments. - Friedrich Otto (CIAA, 2014)

Free Word-Order and Restarting Automata. - Frantisek Mráz; Friedrich Otto; Martin Plátek (Fundam. Informaticae, 2014)

On the classes of languages accepted by limited context restarting automata. - Friedrich Otto; Peter Cerno; Frantisek Mráz (RAIRO Theor. Informatics Appl., 2014)

Two-dimensional Sgraffito automata. - Daniel Prusa; Frantisek Mráz; Friedrich Otto (RAIRO Theor. Informatics Appl., 2014)

Systems of parallel communicating restarting automata. - Marcel Vollweiler; Friedrich Otto (RAIRO Theor. Informatics Appl., 2014)

Weighted Restarting Automata and Pushdown Relations. - Qichao Wang; Norbert Hundeshagen; Friedrich Otto (CAI, 2015)

On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata. - Kent Kwee; Friedrich Otto (DCFS, 2015)

Deterministic Ordered Restarting Automata that Compute Functions. - Friedrich Otto; Kent Kwee (DLT, 2015)

On a class of rational functions for pictures. - Frantisek Mráz; Friedrich Otto; Daniel Prusa (NCMA, 2015)

Reversible Ordered Restarting Automata. - Friedrich Otto; Matthias Wendlandt; Kent Kwee (RC, 2015)

On Visibly Pushdown Trace Languages. - Friedrich Otto (SOFSEM, 2015)

Deterministic ordered restarting automata for picture languages. - Friedrich Otto; Frantisek Mráz (Acta Informatica, 2015)

Preface. - Suna Bensch; Frank Drewes; Mika Hirvensalo; Friedrich Otto (Fundam. Informaticae, 2015)

Asynchronous Parallel Communicating Systems of Pushdown Automata. - Friedrich Otto (Int. J. Found. Comput. Sci., 2015)

Restarting Transducers, Regular Languages, and Rational Relations. - Norbert Hundeshagen; Friedrich Otto (Theory Comput. Syst., 2015)

Lambda-confluence for context rewriting systems. - Friedrich Otto; Frantisek Mráz (Theor. Comput. Sci., 2015)

On Ordered RRWW-Automata. - Kent Kwee; Friedrich Otto (DLT, 2016)

Cyclically extended variants of Sgraffito and restarting automata for picture languages. - Friedrich Otto; Frantisek Mráz (NCMA, 2016)

On the Effects of Nondeterminism on Ordered Restarting Automata. - Kent Kwee; Friedrich Otto (SOFSEM, 2016)

Weighted Restarting Automata as Language Acceptors. - Qichao Wang; Friedrich Otto (CIAA, 2016)

Preface. - Suna Bensch; Rudolf Freund; Mika Hirvensalo; Friedrich Otto (Fundam. Informaticae, 2016)

Some classes of rational functions for pictures. - Frantisek Mráz; Friedrich Otto; Daniel Prusa (RAIRO Theor. Informatics Appl., 2016)

Weighted restarting automata and pushdown relations. - Qichao Wang; Friedrich Otto (Theor. Comput. Sci., 2016)

A Pumping Lemma for Ordered Restarting Automata. - Kent Kwee; Friedrich Otto (DCFS, 2017)

Deleting Deterministic Restarting Automata with Two Windows. - Frantisek Mráz; Friedrich Otto (DLT, 2017)

On h-Lexicalized Automata and h-Syntactic Analysis. - Martin Plátek; Friedrich Otto; Frantisek Mráz (ITAT, 2017)

On shrinking restarting automata. - Friedrich Otto (NCMA, 2017)

On h-Lexicalized Restarting Automata. - Martin Plátek; Friedrich Otto (AFL, 2017)

Regulated variants of limited context restarting automata. - Friedrich Otto; Frantisek Mráz (Theor. Comput. Sci., 2017)

Characterizations of LRR-languages by correctness-preserving computations. - Frantisek Mráz; Friedrich Otto; Martin Plátek (NCMA, 2018)

On the descriptional complexity of stateless deterministic ordered restarting automata. - Friedrich Otto; Kent Kwee (Inf. Comput., 2018)

Nondeterministic Ordered Restarting Automata. - Kent Kwee; Friedrich Otto (Int. J. Found. Comput. Sci., 2018)

Automata with cyclic move operations for picture languages. - Friedrich Otto; Frantisek Mráz (RAIRO Theor. Informatics Appl., 2018)

On Deleting Deterministic Restarting Automata That Have Two Windows. - Frantisek Mráz; Friedrich Otto (J. Autom. Lang. Comb., 2018)

Weighted restarting automata. - Friedrich Otto; Qichao Wang (Soft Comput., 2018)

On Shrinking Restarting Automata of Window Size One and Two. - Frantisek Mráz; Friedrich Otto (DLT, 2019)

Window size two suffices for deterministic monotone RWW-automata. - Frantisek Mráz; Friedrich Otto (NCMA, 2019)

Two-Head Finite-State Acceptors with Translucent Letters. - Benedek Nagy; Friedrich Otto (SOFSEM, 2019)

Lexicalized Syntactic Analysis by Restarting Automata. - Frantisek Mráz; Friedrich Otto; Dana Pardubská; Martin Plátek (Stringology, 2019)

On deterministic ordered restart-delete automata. - Friedrich Otto (Theor. Comput. Sci., 2019)

25 Years of Restarting Automata: Lots of Results and Open Problems. - Friedrich Otto (ITAT, 2020)

A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata. - Friedrich Otto (SOFSEM, 2020)

Linear automata with translucent letters and linear context-free trace languages. - Benedek Nagy; Friedrich Otto (RAIRO Theor. Informatics Appl., 2020)

On Two-Sided Locally Testable Languages. - Martin Kutrib; Friedrich Otto (J. Autom. Lang. Comb., 2020)

On h-Lexicalized Restarting List Automata. - Martin Plátek; Friedrich Otto; Frantisek Mráz (J. Autom. Lang. Comb., 2020)

Reversibility for stateless ordered RRWW-automata. - Friedrich Otto; Matthias Wendlandt (Acta Informatica, 2021)

Two-Sided Strictly Locally Testable Languages. - Markus Holzer 001; Martin Kutrib; Friedrich Otto (Fundam. Informaticae, 2021)

A Complete Taxonomy of Restarting Automata without Auxiliary Symbols. - Friedrich Otto (Fundam. Informaticae, 2021)

On restarting automata with auxiliary symbols and small window size. - Frantisek Mráz; Friedrich Otto (RAIRO Theor. Informatics Appl., 2021)

Lexicalized Syntactic Analysis by Two-Way Restarting Automata. - Frantisek Mráz; Friedrich Otto; Dana Pardubská; Martin Plátek (J. Autom. Lang. Comb., 2021)

On the Expressive Power of Stateless Ordered Restart-Delete Automata. - Friedrich Otto (Theory Comput. Syst., 2021)

Non-Returning Finite Automata With Translucent Letters. - Frantisek Mráz; Friedrich Otto (NCMA, 2022)

One-Way Restarting Automata and Their Sensitivitys. - Martin Plátek; Friedrich Otto; Frantisek Mráz (Int. J. Found. Comput. Sci., 2022)

Recognizing Picture Languages by Reductions to String Languages. - Frantisek Mráz; Friedrich Otto (J. Autom. Lang. Comb., 2022)

A Survey on Automata with Translucent Letters. - Friedrich Otto (CIAA, 2023)

Non-returning deterministic and nondeterministic finite automata with translucent letters. - Frantisek Mráz; Friedrich Otto (RAIRO Theor. Informatics Appl., 2023)

Finite Automata with Sets of Translucent Words. - Benedek Nagy; Friedrich Otto (DLT, 2024)

Repetitive Finite Automata With Translucent Letters. - Frantisek Mráz; Friedrich Otto (NCMA, 2024)

Restarting Automata - Extensions and Generalizations - Friedrich Otto (Springer, 2025)

On A Measure for The Descriptional Complexity of Finite Automata with Translucent Words. - Frantisek Mráz; Friedrich Otto (DCFS, 2025)

On Repetitive Finite Automata with Translucent Words. - Frantisek Mráz; Friedrich Otto (NCMA, 2025)