Friedrich Otto

发表

Free Word-Order and Restarting Automata

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2014, Fundam. Informaticae.

An example of a one-relator group that is not a one-relation monoid

Friedrich Otto, 1988, Discret. Math..

Two Ways of Introducing Alternation into Context-Free Grammars and Pushdown Automata

Friedrich Otto, Etsuro Moriya, 2007, IEICE Trans. Inf. Syst..

On Restarting Automata with Window Size One

Friedrich Otto, F. Otto, 2011, DCFS.

A Completion Procedure for Finitely Presented Groups That Is Based on Word Cycles

Friedrich Otto, Robert Cremanns, F. Otto, 2002, Journal of Automated Reasoning.

On the Complexity of 2-Monotone Restarting Automata

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2004, Developments in Language Theory.

Asynchronous PC Systems of Pushdown Automata

Friedrich Otto, F. Otto, 2013, LATA.

Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata

Norbert Hundeshagen, Friedrich Otto, Marcel Vollweiler, 2010, CIAA.

Length-Reducing Non-Monadic String-Rewriting Systems

Friedrich Otto, Ronald V. Book, 1993 .

Sixth Workshop on Non-Classical Models for Automata and Applications - NCMA 2014, Kassel, Germany, July 28-29, 2014. Proceedings

Rudolf Freund, Friedrich Otto, Suna Bensch, 2014, NCMA.

CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages

Friedrich Otto, Benedek Nagy, 2010, LATA.

On Deciding Confluence of Finite String-Rewriting Systems Modulo Partial Commutativity

Friedrich Otto, F. Otto, 1989, Theor. Comput. Sci..

On determinism versus nondeterminism for restarting automata

Friedrich Otto, Hartmut Messerschmidt, F. Otto, 2008, Inf. Comput..

Elements of finite order for finite weight-reducing and confluent thue systems

Paliath Narendran, Friedrich Otto, 2004, Acta Informatica.

Pushdown Automata with Translucent Pushdown Symbols

Friedrich Otto, Benedek Nagy, Marcel Vollweiler, 2011, NCMA.

Shrinking Alternating Two-Pushdown Automata

Friedrich Otto, Etsuro Moriya, 2004, IEICE Trans. Inf. Syst..

For Groups the Property of Having Finite Derivation Type is Equivalent to the Homological Finiteness Condition FP_3

Friedrich Otto, Robert Cremanns, 1996, J. Symb. Comput..

On the Descriptional Complexity of Deterministic Ordered Restarting Automata

Friedrich Otto, 2014, DCFS.

Growing Context-Sensitive Languages and Church-Rosser Languages

Friedrich Otto, Gerhard Buntrock, 1995, STACS.

Cross-Sections for Finitely Presented Monoids with Decidable Word Problems

Friedrich Otto, Masashi Katsura, Yuji Kobayashi, 1997, RTA.

Further Results on Restarting Automata

Friedrich Otto, Gundula Niemann, 2000, Words, Languages & Combinatorics.

Asynchronous Parallel Communicating Systems of Pushdown Automata

Friedrich Otto, F. Otto, 2015, Int. J. Found. Comput. Sci..

On Alternating Non-Context-Free Grammars

Friedrich Otto, Etsuro Moriya, 2007 .

Undecidability Results for Monoids with Linear-Time Decidable Word Problems

Friedrich Otto, Masashi Katsura, Yuji Kobayashi, 2000, ISAAC.

Restarting automata, Church-Rosser languages, and representations of r.e. languages

Friedrich Otto, Gundula Niemann, 1999, Developments in Language Theory.

Decidable Sentences for Context-Free Groups

Friedrich Otto, Klaus Madlener, 1991, STACS.

Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories

Paliath Narendran, Friedrich Otto, 2004, Journal of Automated Reasoning.

Repetitiveness of D0L-Languages Is Decidable in Polynomial Time

Friedrich Otto, Yuji Kobayashi, 1997, MFCS.

On Centralized PC Grammar Systems with Context-Sensitive Components

Friedrich Otto, F. Otto, 2012, Developments in Language Theory.

Decision problems for finite special string-rewriting systems that are confluent on some congruence class

Friedrich Otto, Louxin Zhang, 2005, Acta Informatica.

Shrinking alternating two-pushdown automata (New Aspects of Theoretical Computer Science)

Friedrich Otto, Etsuro Moriya, F. Otto, 2003 .

CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store

Friedrich Otto, Benedek Nagy, F. Otto, 2011, RAIRO Theor. Informatics Appl..

On confluence versus strong confluence for one-rule trace-rewriting systems

Friedrich Otto, 2005, Mathematical systems theory.

Some Undecidability Results for Non-Monadic Church-Rosser Thue Systems

Friedrich Otto, F. Otto, 1984, Theor. Comput. Sci..

A Pumping Lemma for Ordered Restarting Automata

Friedrich Otto, Kent Kwee, F. Otto, 2017, DCFS.

An Automata-Theoretical Characterization of Context-Free Trace Languages

Friedrich Otto, Benedek Nagy, 2011, SOFSEM.

On Alternating Phrase-Structure Grammars

Friedrich Otto, Etsuro Moriya, 2008, LATA.

On Oleshchuk's Public Key Cryptosystem

Friedrich Otto, Heiko Stamer, 2004, IACR Cryptol. ePrint Arch..

Left-to-right regular languages and two-way restarting automata

Friedrich Otto, 2009, RAIRO Theor. Informatics Appl..

Monadic String-Rewriting Systems

Friedrich Otto, Ronald V. Book, 1993 .

ON PROPER LANGUAGES AND TRANSFORMATIONS OF LEXICALIZED TYPES OF AUTOMATA

Friedrich Otto, 2010 .

On Lexicalized Well-Behaved Restarting Automata That Are Monotone

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2010, Developments in Language Theory.

Pseudo-Natural Algorithms for the Word Problem for Finitely Presented Monoids and Groups

Friedrich Otto, Klaus Madlener, 1985, J. Symb. Comput..

Separating the Intrinsic Complexity and the Derivational complexity of the Word Problem for Finitely Presented Groups

Friedrich Otto, Daniel E. Cohen, Klaus Madlener, 1993, Math. Log. Q..

Deterministic ordered restarting automata for picture languages

Frantisek Mráz, Friedrich Otto, 2015, Acta Informatica.

Restarting Automata for Picture Languages: A Survey on Recent Developments

Friedrich Otto, 2014, CIAA.

Preface

Rudolf Freund, Martin Kutrib, Friedrich Otto, 2011, Fundam. Informaticae.

On the Effects of Nondeterminism on Ordered Restarting Automata

Friedrich Otto, Kent Kwee, F. Otto, 2016, SOFSEM.

On Deleting Deterministic Restarting Automata That Have Two Windows

Frantisek Mráz, Friedrich Otto, 2018, J. Autom. Lang. Comb..

The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems

Friedrich Otto, 2005, Mathematical systems theory.

On Centralized Parallel Communicating Grammar Systems with Context-Sensitive Components

Friedrich Otto, 2013, Int. J. Found. Comput. Sci..

On state-alternating context-free grammars

Friedrich Otto, Etsuro Moriya, Dieter Hofbauer, 2005, Theor. Comput. Sci..

Ordered Restarting Automata for Picture Languages

Frantisek Mráz, Friedrich Otto, 2014, SOFSEM.

Confluent Internal Contextual Languages

Friedrich Otto, Gundula Niemann, 2000, Recent Topics in Mathematical and Computational Linguistics.

Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers

Henning Fernau, Carlos Martín-Vide, Friedrich Otto, 2008, LATA.

Weighted Restarting Automata as Language Acceptors

Friedrich Otto, Qichao Wang, 2016, CIAA.

Reversible Ordered Restarting Automata

Friedrich Otto, Matthias Wendlandt, Kent Kwee, 2015, RC.

Parallel Communicating Grammar Systems with Regular Control

Friedrich Otto, Martin Plátek, Dana Pardubská, 2009, CAI.

The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages

Friedrich Otto, Gundula Niemann, 2005, Inf. Comput..

Computing presentations for subgroups of polycyclic groups and of context-free groups

Friedrich Otto, Norbert Kuhn, Klaus Madlener, 2005, Applicable Algebra in Engineering, Communication and Computing.

On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems

Peter Leupold, Friedrich Otto, 2011, Fundam. Informaticae.

Lower Bounds for Nonforgetting Restarting Automata and CD-Systems of Restarting Automata

Friedrich Otto, F. Otto, 2008 .

Restricting the Use of Auxiliary Symbols for Restarting Automata

Friedrich Otto, Tomasz Jurdzinski, 2005, CIAA.

Some Results on RWW- and RRWW-Automata and their Relation to the Class of Growing Context-Sensitive Languages

Friedrich Otto, Krzysztof Lorys, Tomasz Jurdzinski, 2004, J. Autom. Lang. Comb..

On Deciding the Confluence of a Finite String-Rewriting System on a Given Congruence Class

Friedrich Otto, F. Otto, 1987, J. Comput. Syst. Sci..

Characterizations of LRR-languages by correctness-preserving computations

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2018, NCMA.

Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2005, Developments in Language Theory.

Globally deterministic CD-systems of stateless R-automata with window size 1

Friedrich Otto, Benedek Nagy, F. Otto, 2013, Int. J. Comput. Math..

A test for λ-confluence for certain prefix rewriting systems with applications to the generalized word problem

Friedrich Otto, Norbert Kuhn, Klaus Madlener, 1990, ISSAC '90.

The Property Fdt is Undecidable for Finitely Presented Monoids that Have Polynomial-Time Decidable Word Problems

Friedrich Otto, Andrea Sattler-Klein, 2000, Int. J. Algebra Comput..

Complexity Results on the Conjugacy Problem for Monoids

Paliath Narendran, Friedrich Otto, P. Narendran, 1985, Theor. Comput. Sci..

Characterizing the Regular Languages by Nonforgetting Restarting Automata

Norbert Hundeshagen, Friedrich Otto, F. Otto, 2011, Developments in Language Theory.

Window size two suffices for deterministic monotone RWW-automata

Frantisek Mráz, Friedrich Otto, 2019, NCMA.

Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata

Friedrich Otto, F. Otto, 2012, DCFS.

Shrinking Multi-pushdown Automata

Friedrich Otto, Markus Holzer, 2005, FCT.

On Visibly Pushdown Trace Languages

Friedrich Otto, F. Otto, 2015, SOFSEM.

Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems

Friedrich Otto, Craig C. Squier, F. Otto, 1987, RTA.

Correctness Preservation and Complexity of Simple RL-Automata

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2006, CIAA.

Restarting automata with restricted utilization of auxiliary symbols

Friedrich Otto, Tomasz Jurdzinski, 2006, Theor. Comput. Sci..

Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata

Friedrich Otto, Benedek Nagy, 2012, Acta Informatica.

Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditions

Friedrich Otto, Masashi Katsura, Yuji Kobayashi, 2003, Theor. Comput. Sci..

Two-sided locally testable languages

Martin Kutrib, Friedrich Otto, F. Otto, 2018, NCMA.

McNaughton families of languages

Friedrich Otto, Markus Holzer, Martin Beaudry, 2003, Theor. Comput. Sci..

A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata

Friedrich Otto, Hartmut Messerschmidt, F. Otto, 2011, Theory of Computing Systems.

On Alternating Phrase-Structure Grammars

Friedrich Otto, Etsuro Moriya, 2010, Int. J. Found. Comput. Sci..

Cyclically extended variants of Sgraffito and restarting automata for picture languages

Frantisek Mráz, Friedrich Otto, 2016, NCMA.

Restarting Tree Automata and Linear Context-Free Tree Languages

Friedrich Otto, Heiko Stamer, 2007, CAI.

Regulated variants of limited context restarting automata

Frantisek Mráz, Friedrich Otto, 2017, Theor. Comput. Sci..

A note on thue systems with a single defining relation

Friedrich Otto, Celia Wrathall, F. Otto, 1985, Mathematical systems theory.

String-Rewriting Systems

Friedrich Otto, Ronald V. Book, R. V. Book, 1993, Text and Monographs in Computer Science.

Some Independent Results for Equational Unification

Paliath Narendran, Friedrich Otto, Daniel J. Dougherty, 1995, RTA.

On Alternating Context-Free Grammars : Old and New Versions and Their Characterizations : An Extended Abstract (Evolutionary Advancement in Fundamental Theories of Computer Science)

Friedrich Otto, Etsuro Moriya, Dieter Hofbauer, 2004 .

Finite complete rewriting systems and the complexity of the word problem

Friedrich Otto, G. Bauer, F. Otto, 1984, Acta Informatica.

Limited Context Restarting Automata and McNaughton Families of Languages

Frantisek Mráz, Friedrich Otto, Peter Cerno, 2012, NCMA.

On a class of rational functions for pictures

Frantisek Mráz, Friedrich Otto, Daniel Prusa, 2015, NCMA.

Relations and Transductions Realized by Restarting Automata

Martin Kutrib, Friedrich Otto, Informatik, 2013 .

Single-Path Restarting Tree Automata

Friedrich Otto, Heiko Stamer, 2009, CAI.

Strictly Deterministic CD-Systems of Restarting Automata

Friedrich Otto, Hartmut Messerschmidt, F. Otto, 2007, FCT.

Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2006, Theor. Comput. Sci..

Church-Rosser Thue systems and formal languages

Paliath Narendran, Robert McNaughton, Friedrich Otto, 1988, JACM.

Sequential monotonicity for restarting automata

Friedrich Otto, Tomasz Jurdzinski, 2007, RAIRO Theor. Informatics Appl..

A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet

Friedrich Otto, Yuji Kobayashi, Patrice Séébold, 1997, COCOON.

Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented Monoids

Friedrich Otto, Masashi Katsura, Yuji Kobayashi, 1998, J. Symb. Comput..

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, 2009, Theor. Comput. Sci..

On Stateless Two-Pushdown Automata and Restarting Automata

Martin Kutrib, Friedrich Otto, Hartmut Messerschmidt, 2010, Int. J. Found. Comput. Sci..

On Shrinking Restarting Automata of Window Size One and Two

Frantisek Mráz, Friedrich Otto, 2019, DLT.

Classes of regular and context-free languages over countably infinite alphabets

Friedrich Otto, 1985, Discret. Appl. Math..

On the Property of Preserving Regularity for String-Rewriting Systems

Friedrich Otto, 1997, RTA.

On the classes of languages accepted by limited context restarting automata

Frantisek Mráz, Friedrich Otto, Peter Cerno, 2014, RAIRO Theor. Informatics Appl..

25 Years of Restarting Automata: Lots of Results and Open Problems

Friedrich Otto, 2020, ITAT.

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata

Friedrich Otto, Martin Plátek, Dana Pardubská, 2009, LATA.

About the Descriptive Power of Certain Classes of Finite String-Rewriting Systems

Friedrich Otto, Klaus Madlener, 1989, Theor. Comput. Sci..

Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13 - August 14, 2013, Proceedings

Rudolf Freund, Friedrich Otto, Frank Drewes, 2013, NCMA.

On Homotopical and Homological Finiteness Conditions for Finitely Presented Monoids

Friedrich Otto, Yuji Kobayashi, F. Otto, 2001, Int. J. Algebra Comput..

CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions

Friedrich Otto, F. Otto, 2009, SOFSEM.

On the Connections between Rewriting and Formal Language Theory

Friedrich Otto, F. Otto, 1999, RTA.

Two-dimensional hierarchies of proper languages of lexicalized FRR-automata

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2009, Inf. Comput..

On PCGS and FRR-automata

Friedrich Otto, Martin Plátek, Dana Pardubská, 2008, ITAT.

Preface

Rudolf Freund, Friedrich Otto, Mika Hirvensalo, 2016, Fundam. Informaticae.

On Deterministic CD-Systems of Restarting Automata

Friedrich Otto, Hartmut Messerschmidt, F. Otto, 2009, Int. J. Found. Comput. Sci..

On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata

Friedrich Otto, Kent Kwee, F. Otto, 2015, DCFS.

On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata

Martin Kutrib, Friedrich Otto, 2012, CIAA.

Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2005, Fundam. Informaticae.

On stateless deterministic restarting automata

Martin Kutrib, Friedrich Otto, Hartmut Messerschmidt, 2009, Acta Informatica.

Restarting Automata and Their Relations to the Chomsky Hierarchy

Friedrich Otto, 2003, Developments in Language Theory.

On Ground-Confluence of Term Rewriting Systems

Paliath Narendran, Friedrich Otto, Deepak Kapur, 1990, Inf. Comput..

On the Verifiability of Two-Party Algebraic Protocols

Friedrich Otto, Ronald V. Book, 1985, Theor. Comput. Sci..

New Results on Deterministic Sgraffito Automata

Frantisek Mráz, Friedrich Otto, Daniel Prusa, 2013, Developments in Language Theory.

On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata

Martin Kutrib, Friedrich Otto, F. Otto, 2012, Languages Alive.

Pseudo-Natural Algorithms for Finitely Generated Presentations of Monoids and Groups

Friedrich Otto, Klaus Madlener, F. Otto, 1988, J. Symb. Comput..

Confluent Monadic String-Rewriting Systems and Automatic Structures

Nikola Ruskuc, Friedrich Otto, F. Otto, 2001, J. Autom. Lang. Comb..

On deciding whether a monoid is a free monoid or is a group

Friedrich Otto, 2004, Acta Informatica.

The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent

Paliath Narendran, Friedrich Otto, 1997, ICALP.

A Finiteness Condition for Rewriting Systems

Friedrich Otto, Yuji Kobayashi, Craig C. Squier, 1994, Theor. Comput. Sci..

On Weakly Confluent Monadic String-Rewriting Systems

Paliath Narendran, Friedrich Otto, Louxin Zhang, 1993, Theor. Comput. Sci..

Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2007, MCU.

Preface

Friedrich Otto, Mika Hirvensalo, Frank Drewes, 2015, Fundam. Informaticae.

On McNaughton Families of Languages Specified by Certain Variants of Monadic String-Rewriting Systems

Peter Leupold, Friedrich Otto, 2010, NCMA.

A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata

Friedrich Otto, 2020, SOFSEM.

The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages

Friedrich Otto, Gundula Niemann, 1998, FoSSaCS.

Some Undecidability Results Concerning the Property of Preserving Regularity

Friedrich Otto, 1998, Theor. Comput. Sci..

On S-Regular Prefix-Rewriting Systems and Automatic Structures

Friedrich Otto, F. Otto, 1999, COCOON.

Church-Rosser Languages and Their Relationship to Other Language Classes

Friedrich Otto, Gundula Niemann, F. Otto, 2003, Grammars and Automata for String Processing.

Generating Small Convergent Systems Can Be Extremely Hard

Friedrich Otto, Klaus Madlener, Andrea Sattler-Klein, 1992, ISAAC.

On h-Lexicalized Restarting List Automata

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2020, J. Autom. Lang. Comb..

Characterizing the Rational Functions by Restarting Transducers

Norbert Hundeshagen, Friedrich Otto, F. Otto, 2012, LATA.

Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems

Friedrich Otto, 1985, RTA.

On Determinism Versus Non-Determinism for Restarting Automata

Friedrich Otto, Hartmut Messerschmidt, 2007, LATA.

Restarting Automata and Variants of j-Monotonicity

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2003, DCFS.

Linear automata with translucent letters and linear context-free trace languages

Friedrich Otto, Benedek Nagy, F. Otto, 2020, RAIRO Theor. Informatics Appl..

20. Theorietag der GI-Fachgruppe "Automaten und Formale Sprachen''

Henrik Björklund, Artiom Alhazov, Rudolf Freund, 2010 .

On Dehn Functions of Finitely Presented Bi-Automatic Monoids

Friedrich Otto, F. Otto, 2000, J. Autom. Lang. Comb..

A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups

Paliath Narendran, Friedrich Otto, Klaus Madlener, 1991, ICALP.

On the descriptional complexity of stateless deterministic ordered restarting automata

Friedrich Otto, Kent Kwee, F. Otto, 2017, Inf. Comput..

On h-Lexicalized Restarting Automata

Friedrich Otto, Martin Plátek, 2017, AFL.

Constructing canonical presentations for subgroups of context-free groups in polynomial time (extended abstract)

Friedrich Otto, Robert Cremanns, 1994, ISSAC '94.

Computing presentations for subgroups of context-free groups

Friedrich Otto, Norbert Kuhn, Klaus Madlener, 1992, ISSAC '92.

On the Gap-Complexity of Simple RL-Automata

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2006, Developments in Language Theory.

Repetitiveness of languages generated by morphisms

Friedrich Otto, Yuji Kobayashi, 2000, Theor. Comput. Sci..

Finite Complete Rewriting Systems for the Jantzen Monoid and the Greendlinger Group

Friedrich Otto, F. Otto, 1984, Theor. Comput. Sci..

Cooperating Distributed Systems of Restarting Automata

Friedrich Otto, Hartmut Messerschmidt, F. Otto, 2007, Int. J. Found. Comput. Sci..

Lambda-confluence for context rewriting systems

Frantisek Mráz, Friedrich Otto, 2015, Theor. Comput. Sci..

Using String-Rewriting for Solving the Word Problem for Finitely Presented Groups

Friedrich Otto, Klaus Madlener, 1987, Inf. Process. Lett..

On the Security of Name-Stamp Protocols

Friedrich Otto, Ronald V. Book, 1985, Theor. Comput. Sci..

Restarting Transducers, Regular Languages, and Rational Relations

Norbert Hundeshagen, Friedrich Otto, 2014, Theory of Computing Systems.

Cutter for lump food

Friedrich Otto, Friedhelm Eusterbarkey, フリートヘルム・オイスターバルキー, 1994 .

On the Problem of Generating Small Convergent Systems

Friedrich Otto, Klaus Madlener, Andrea Sattler-Klein, 1993, J. Symb. Comput..

Nondeterministic Ordered Restarting Automata

Friedrich Otto, Kent Kwee, F. Otto, 2018, Int. J. Found. Comput. Sci..

Deterministic Ordered Restarting Automata that Compute Functions

Friedrich Otto, Kent Kwee, 2015, DLT.

Weighted Restarting Automata and Pushdown Relations

Norbert Hundeshagen, Friedrich Otto, Qichao Wang, 2015, CAI.

Two-Head Finite-State Acceptors with Translucent Letters

Friedrich Otto, Benedek Nagy, F. Otto, 2019, SOFSEM.

A Measure for the Degree of Nondeterminism of Context-Free Languages

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2007, CIAA.

On shrinking restarting automata

Friedrich Otto, 2017, NCMA.

On the Complexity of 2-Monotone Restarting Automata

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2004, Theory of Computing Systems.

A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata

Friedrich Otto, Martin Plátek, 2008, LATA.

On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone

Friedrich Otto, Hartmut Messerschmidt, 2006, CSR.

On Deterministic Ordered Restart-Delete Automata

Friedrich Otto, 2018, DLT.

Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata

Frantisek Mráz, Friedrich Otto, Daniel Prusa, 2013, CIAA.

Systems of parallel communicating restarting automata

Friedrich Otto, Marcel Vollweiler, F. Otto, 2012, RAIRO Theor. Informatics Appl..

On CD-systems of stateless deterministic R-automata with window size one

Friedrich Otto, Benedek Nagy, F. Otto, 2012, J. Comput. Syst. Sci..

Some Exact Sequences for The Homotopy (Bi-)Module af A Monoid

Friedrich Otto, Yuji Kobayashi, F. Otto, 2002, Int. J. Algebra Comput..

Completing a finite special string-rewriting system on the congruence class of the empty word

Friedrich Otto, 2005, Applicable Algebra in Engineering, Communication and Computing.

The Verifiability of Two-Party Protocols

Friedrich Otto, Ronald V. Book, R. V. Book, 1985, EUROCRYPT.

Automata with cyclic move operations for picture languages

Frantisek Mráz, Friedrich Otto, 2018, RAIRO Theor. Informatics Appl..

Finite canonical rewriting systems for congruences generated by concurrency relations

Friedrich Otto, F. Otto, 1987, Mathematical systems theory.

One-Rule Trace-Rewriting Systems and Confluence

Volker Diekert, Friedrich Otto, Celia Wrathall, 1992, MFCS.

Preperfectness is Undecidable for Thue Systems Containing Only Length-Reducing Rules and a Single Commutation Rule

Paliath Narendran, Friedrich Otto, 1988, Inf. Process. Lett..

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, 1987, AAECC.

Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems - A Survey

Friedrich Otto, Yuji Kobayashi, F. Otto, 1997, Advances in Algorithms, Languages, and Complexity.

Commutativity in Groups Presented By Finite Church-Rosser Thue Systems

Friedrich Otto, Klaus Madlener, F. Otto, 1988, RAIRO Theor. Informatics Appl..

Hierarchies of weakly monotone restarting automata

Frantisek Mráz, Friedrich Otto, 2005, RAIRO Theor. Informatics Appl..

Globally Deterministic CD-Systems of Stateless R(1)-Automata

Friedrich Otto, Benedek Nagy, 2011, LATA.

Parallel communicating grammar systems with regular control and skeleton preserving FRR automata

Friedrich Otto, Martin Plátek, Dana Pardubská, 2011, Theor. Comput. Sci..

On Left-Monotone Deterministic Restarting Automata

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2004, Developments in Language Theory.

Degrees of non-monotonicity for restarting automata

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2006, Theor. Comput. Sci..

Finite Derivation Type Implies the Homological Finiteness Condition FP_3

Friedrich Otto, Robert Cremanns, 1994, J. Symb. Comput..

Two-dimensional Sgraffito automata

Frantisek Mráz, Friedrich Otto, Daniel Prusa, 2014, RAIRO Theor. Informatics Appl..

Church-Rosser Groups and Growing Context-Sensitive Groups

Friedrich Otto, Mark Kambites, 2008, J. Autom. Lang. Comb..

On the Descriptional Complexity of the Window Size for Deleting Restarting Automata

Martin Kutrib, Friedrich Otto, 2013, Int. J. Found. Comput. Sci..

XSSR: AN EXPERIMENTAL SYSTEM FOR STRING REWRITING – DECISION PROBLEMS, ALGORITHMS, AND IMPLEMENTATION

Friedrich Otto, Dieter Hofbauer, Klaus Madlener, 2002 .

On Ordered RRWW-Automata

Friedrich Otto, Kent Kwee, 2016, DLT.

Restarting Tree Automata

Friedrich Otto, Heiko Stamer, F. Otto, 2007, SOFSEM.

Some classes of rational functions for pictures

Frantisek Mráz, Friedrich Otto, Daniel Prusa, 2016, RAIRO Theor. Informatics Appl..

When is an Extension of a Specification Consistent? Decidable and Undecidable Cases

Friedrich Otto, F. Otto, 1991, J. Symb. Comput..

Overlaps in Free Partially Commutative Monoids

Friedrich Otto, Celia Wrathall, 1991, J. Comput. Syst. Sci..

Cancellation Rules and Extended Word Problems

Friedrich Otto, Ronald V. Book, 1985, Inf. Process. Lett..

Some Undecidability Results for Weakly Confluent Monadic String-Rewriting Systems

Friedrich Otto, 1991, AAECC.

On the Power of RRWW-Automata

Friedrich Otto, Gundula Niemann, 2001, Words, Semigroups, and Transductions.

Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General

Friedrich Otto, 1995, Inf. Process. Lett..

Shrinking Restarting Automata

Friedrich Otto, Tomasz Jurdzinski, 2007, Int. J. Found. Comput. Sci..

Extended Two-Way Ordered Restarting Automata for Picture Languages

Frantisek Mráz, Friedrich Otto, 2014, LATA.

Weighted restarting automata and pushdown relations

Friedrich Otto, Qichao Wang, 2016, Theor. Comput. Sci..

Equational Unification, Word Unification, and 2nd-Order Equational Unification

Paliath Narendran, Friedrich Otto, Daniel J. Dougherty, 1998, Theor. Comput. Sci..

Automatic Monoids Versus Monoids with Finite Convergent Presentations

Friedrich Otto, Klaus Madlener, Andrea Sattler-Klein, 1998, RTA.

FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems

Friedrich Otto, Andrea Sattler-Klein, 1997, FCT.

The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems is NP-Complete

Paliath Narendran, Karl Winklmann, Friedrich Otto, 1984, Inf. Control..

Two-sided strictly locally testable languages

Martin Kutrib, Friedrich Otto, Markus Holzer, 2017, NCMA.

Lambda-Confluence Is Undecidable for Clearing Restarting Automata

Frantisek Mráz, Friedrich Otto, 2013, CIAA.

Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems

Friedrich Otto, 1989, RTA.

Learning Analysis by Reduction from Positive Data

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2006, ICGI.

Some Undecidability Results for Finitely Generated Thue Congruences on aTwo-Letter Alphabet

Friedrich Otto, Klaus Madlener, 1997, Fundam. Informaticae.

Deleting Deterministic Restarting Automata with Two Windows

Frantisek Mráz, Friedrich Otto, 2017, DLT.

Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011)

Rudolf Freund, Friedrich Otto, Carlo Mereghetti, 2012, RAIRO Theor. Informatics Appl..

On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy

Friedrich Otto, Markus Holzer, Martin Beaudry, 2001, Developments in Language Theory.

A Complete Taxonomy of Restarting Automata without Auxiliary Symbols

Friedrich Otto, 2021, Fundam. Informaticae.

Lexicalized Syntactic Analysis by Two-Way Restarting Automata

Frantisek Mráz, Friedrich Otto, Martin Plátek, 2021, J. Autom. Lang. Comb..

Reversibility for stateless ordered RRWW-automata

Friedrich Otto, Matthias Wendlandt, 2021, Acta Informatica.

On restarting automata with auxiliary symbols and small window size

Friedrich Otto, František Mráz, 2021, RAIRO Theor. Informatics Appl..

On the Expressive Power of Stateless Ordered Restart-Delete Automata

Friedrich Otto, 2021, Theory Comput. Syst..

Elements of finite order for finite monadic Church-Rosser Thue systems

Friedrich Otto, 1985 .

Some remarks on finitely presented monoids with automatic structure

Friedrich Otto, Andrea Sattler-Klein, 1997 .

Groups presented by finite two-monadic Church-Rosser Thue systems

Friedrich Otto, Jürgen Avenhaus, Klaus Madlener, 1986 .

Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems

Friedrich Otto, Klaus Madlener, Friedrich Otto, 1987, RTA.

SOME RELATIVES OF AUTOMATIC AND HYPERBOLIC GROUPS

Friedrich Otto, Dietrich Kuske, Michael Hoffmann, 2002 .

On groups having finite monadic church-rosser presentations

Friedrich Otto, Klaus Madlener, F. Otto, 1988 .

Uniform decision problems for automatic semigroups

Friedrich Otto, Mark Kambites, 2005 .

For finitely presented monoids the homological finiteness conditions FHT and bi-FP3 coincide

Friedrich Otto, F. Otto, Yuji Kobayashi, 2003 .

Some Decidability and Undecidability Results on Green's Relations for Automatic Monoids

Friedrich Otto, F. Otto, 2007 .

Conjugacy in monoids with a special Church-Rosser presentation is decidable

Friedrich Otto, F. Otto, 1984 .

On two problems related to cancellativity

Friedrich Otto, F. Otto, 1986 .

FOR REWRITING SYSTEMS THE TOPOLOGICAL FINITENESS CONDITIONS FDT AND FHT ARE NOT EQUIVALENT

Friedrich Otto, Stephen J. Pride, 2004 .