Friedrich Otto

255 papers A* 3A 3B 20C 40Misc 4Journal 126Unranked 51
YearRankTypeTitle / Venue / Authors
2025 — conf
On A Measure for The Descriptional Complexity of Finite Automata with Translucent Words.
DCFS
Frantisek Mráz, Friedrich Otto
2025 — conf
On Repetitive Finite Automata with Translucent Words.
NCMA
Frantisek Mráz, Friedrich Otto
2025 — book
Restarting Automata - Extensions and Generalizations
Friedrich Otto
2024 C conf
Finite Automata with Sets of Translucent Words.
DLT
Benedek Nagy, Friedrich Otto
2024 — conf
Repetitive Finite Automata With Translucent Letters.
NCMA
Frantisek Mráz, Friedrich Otto
2023 C conf
A Survey on Automata with Translucent Letters.
CIAA
Friedrich Otto
2023 J jnl
Non-returning deterministic and nondeterministic finite automata with translucent letters.
RAIRO Theor. Informatics Appl.
Frantisek Mráz, Friedrich Otto
2022 — conf
Non-Returning Finite Automata With Translucent Letters.
NCMA
Frantisek Mráz, Friedrich Otto
2022 J jnl
One-Way Restarting Automata and Their Sensitivitys.
Int. J. Found. Comput. Sci.
Martin Plátek, Friedrich Otto, Frantisek Mráz
2022 J jnl
Recognizing Picture Languages by Reductions to String Languages.
J. Autom. Lang. Comb.
Frantisek Mráz, Friedrich Otto
2021 J jnl
A Complete Taxonomy of Restarting Automata without Auxiliary Symbols.
Fundam. Informaticae
Friedrich Otto
2021 J jnl
Lexicalized Syntactic Analysis by Two-Way Restarting Automata.
J. Autom. Lang. Comb.
Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek
2021 J jnl
On restarting automata with auxiliary symbols and small window size.
RAIRO Theor. Informatics Appl.
Frantisek Mráz, Friedrich Otto
2021 J jnl
On the Expressive Power of Stateless Ordered Restart-Delete Automata.
Theory Comput. Syst.
Friedrich Otto
2021 J jnl
Reversibility for stateless ordered RRWW-automata.
Acta Informatica
Friedrich Otto, Matthias Wendlandt
2021 J jnl
Two-Sided Strictly Locally Testable Languages.
Fundam. Informaticae
Markus Holzer, Martin Kutrib, Friedrich Otto
2020 — conf
25 Years of Restarting Automata: Lots of Results and Open Problems.
ITAT
Friedrich Otto
2020 B conf
A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata.
SOFSEM
Friedrich Otto
2020 J jnl
Linear automata with translucent letters and linear context-free trace languages.
RAIRO Theor. Informatics Appl.
Benedek Nagy, Friedrich Otto
2020 J jnl
On Two-Sided Locally Testable Languages.
J. Autom. Lang. Comb.
Martin Kutrib, Friedrich Otto
2020 J jnl
On h-Lexicalized Restarting List Automata.
J. Autom. Lang. Comb.
Martin Plátek, Friedrich Otto, Frantisek Mráz
2019 Misc conf
Lexicalized Syntactic Analysis by Restarting Automata.
PSC
Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek
2019 C conf
On Shrinking Restarting Automata of Window Size One and Two.
DLT
Frantisek Mráz, Friedrich Otto
2019 J jnl
On deterministic ordered restart-delete automata.
Theor. Comput. Sci.
Friedrich Otto
2019 B conf
Two-Head Finite-State Acceptors with Translucent Letters.
SOFSEM
Benedek Nagy, Friedrich Otto
2019 — conf
Window size two suffices for deterministic monotone RWW-automata.
NCMA
Frantisek Mráz, Friedrich Otto
2018 J jnl
Automata with cyclic move operations for picture languages.
RAIRO Theor. Informatics Appl.
Friedrich Otto, Frantisek Mráz
2018 — conf
Characterizations of LRR-languages by correctness-preserving computations.
NCMA
Frantisek Mráz, Friedrich Otto, Martin Plátek
2018 J jnl
Nondeterministic Ordered Restarting Automata.
Int. J. Found. Comput. Sci.
Kent Kwee, Friedrich Otto
2018 J jnl
On Deleting Deterministic Restarting Automata That Have Two Windows.
J. Autom. Lang. Comb.
Frantisek Mráz, Friedrich Otto
2018 C conf
On Deterministic Ordered Restart-Delete Automata.
DLT
Friedrich Otto
2018 J jnl
On the descriptional complexity of stateless deterministic ordered restarting automata.
Inf. Comput.
Friedrich Otto, Kent Kwee
2018 — conf
Two-sided locally testable languages.
NCMA
Martin Kutrib, Friedrich Otto
2018 J jnl
Weighted restarting automata.
Soft Comput.
Friedrich Otto, Qichao Wang
2017 — conf
A Pumping Lemma for Ordered Restarting Automata.
DCFS
Kent Kwee, Friedrich Otto
2017 C conf
Deleting Deterministic Restarting Automata with Two Windows.
DLT
Frantisek Mráz, Friedrich Otto
2017 — conf
On h-Lexicalized Automata and h-Syntactic Analysis.
ITAT
Martin Plátek, Friedrich Otto, Frantisek Mráz
2017 — conf
On h-Lexicalized Restarting Automata.
AFL
Martin Plátek, Friedrich Otto
2017 — conf
On shrinking restarting automata.
NCMA
Friedrich Otto
2017 J jnl
Regulated variants of limited context restarting automata.
Theor. Comput. Sci.
Friedrich Otto, Frantisek Mráz
2017 — conf
Two-sided strictly locally testable languages.
NCMA
Markus Holzer, Martin Kutrib, Friedrich Otto
2016 — conf
Cyclically extended variants of Sgraffito and restarting automata for picture languages.
NCMA
Friedrich Otto, Frantisek Mráz
2016 C conf
On Ordered RRWW-Automata.
DLT
Kent Kwee, Friedrich Otto
2016 B conf
On the Effects of Nondeterminism on Ordered Restarting Automata.
SOFSEM
Kent Kwee, Friedrich Otto
2016 J jnl
Preface.
Fundam. Informaticae
Suna Bensch, Rudolf Freund, Mika Hirvensalo, Friedrich Otto
2016 J jnl
Some classes of rational functions for pictures.
RAIRO Theor. Informatics Appl.
Frantisek Mráz, Friedrich Otto, Daniel Prusa
2016 C conf
Weighted Restarting Automata as Language Acceptors.
CIAA
Qichao Wang, Friedrich Otto
2016 J jnl
Weighted restarting automata and pushdown relations.
Theor. Comput. Sci.
Qichao Wang, Friedrich Otto
2015 J jnl
Asynchronous Parallel Communicating Systems of Pushdown Automata.
Int. J. Found. Comput. Sci.
Friedrich Otto
2015 C conf
Deterministic Ordered Restarting Automata that Compute Functions.
DLT
Friedrich Otto, Kent Kwee
2015 J jnl
Deterministic ordered restarting automata for picture languages.
Acta Informatica
Friedrich Otto, Frantisek Mráz
2015 J jnl
Lambda-confluence for context rewriting systems.
Theor. Comput. Sci.
Friedrich Otto, Frantisek Mráz
2015 — conf
On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata.
DCFS
Kent Kwee, Friedrich Otto
2015 B conf
On Visibly Pushdown Trace Languages.
SOFSEM
Friedrich Otto
2015 — conf
On a class of rational functions for pictures.
NCMA
Frantisek Mráz, Friedrich Otto, Daniel Prusa
2015 J jnl
Preface.
Fundam. Informaticae
Suna Bensch, Frank Drewes, Mika Hirvensalo, Friedrich Otto
2015 J jnl
Restarting Transducers, Regular Languages, and Rational Relations.
Theory Comput. Syst.
Norbert Hundeshagen, Friedrich Otto
2015 C conf
Reversible Ordered Restarting Automata.
RC
Friedrich Otto, Matthias Wendlandt, Kent Kwee
2015 — conf
Weighted Restarting Automata and Pushdown Relations.
CAI
Qichao Wang, Norbert Hundeshagen, Friedrich Otto
2014 C conf
Extended Two-Way Ordered Restarting Automata for Picture Languages.
LATA
Friedrich Otto, Frantisek Mráz
2014 J jnl
Free Word-Order and Restarting Automata.
Fundam. Informaticae
Frantisek Mráz, Friedrich Otto, Martin Plátek
2014 — conf
On the Descriptional Complexity of Deterministic Ordered Restarting Automata.
DCFS
Friedrich Otto
2014 J jnl
On the classes of languages accepted by limited context restarting automata.
RAIRO Theor. Informatics Appl.
Friedrich Otto, Peter Cerno, Frantisek Mráz
2014 B conf
Ordered Restarting Automata for Picture Languages.
SOFSEM
Frantisek Mráz, Friedrich Otto
2014 C conf
Restarting Automata for Picture Languages: A Survey on Recent Developments.
CIAA
Friedrich Otto
2014 — ed.
Sixth Workshop on Non-Classical Models for Automata and Applications - NCMA 2014, Kassel, Germany, July 28-29, 2014. Proceedings
NCMA
Suna Bensch, Rudolf Freund, Friedrich Otto
2014 J jnl
Systems of parallel communicating restarting automata.
RAIRO Theor. Informatics Appl.
Marcel Vollweiler, Friedrich Otto
2014 J jnl
Two-dimensional Sgraffito automata.
RAIRO Theor. Informatics Appl.
Daniel Prusa, Frantisek Mráz, Friedrich Otto
2013 C conf
Asynchronous PC Systems of Pushdown Automata.
LATA
Friedrich Otto
2013 C conf
Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata.
CIAA
Daniel Prusa, Frantisek Mráz, Friedrich Otto
2013 J jnl
Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata.
Acta Informatica
Benedek Nagy, Friedrich Otto
2013 — ed.
Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13 - August 14, 2013, Proceedings
NCMA
Suna Bensch, Frank Drewes, Rudolf Freund, Friedrich Otto
2013 J jnl
Globally deterministic CD-systems of stateless R-automata with window size 1.
Int. J. Comput. Math.
Benedek Nagy, Friedrich Otto
2013 C conf
Lambda-Confluence Is Undecidable for Clearing Restarting Automata.
CIAA
Frantisek Mráz, Friedrich Otto
2013 C conf
New Results on Deterministic Sgraffito Automata.
Developments in Language Theory
Daniel Prusa, Frantisek Mráz, Friedrich Otto
2013 J jnl
On Centralized Parallel Communicating Grammar Systems with Context-Sensitive Components.
Int. J. Found. Comput. Sci.
Friedrich Otto
2013 J jnl
On the Descriptional Complexity of the Window Size for Deleting Restarting Automata.
Int. J. Found. Comput. Sci.
Martin Kutrib, Friedrich Otto
2012 — conf
Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata.
DCFS
Friedrich Otto
2012 C conf
Characterizing the Rational Functions by Restarting Transducers.
LATA
Norbert Hundeshagen, Friedrich Otto
2012 — conf
Limited Context Restarting Automata and McNaughton Families of Languages.
NCMA
Friedrich Otto, Peter Cerno, Frantisek Mráz
2012 — conf
On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata.
Languages Alive
Martin Kutrib, Friedrich Otto
2012 J jnl
On CD-systems of stateless deterministic R-automata with window size one.
J. Comput. Syst. Sci.
Benedek Nagy, Friedrich Otto
2012 C conf
On Centralized PC Grammar Systems with Context-Sensitive Components.
Developments in Language Theory
Friedrich Otto
2012 C conf
On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata.
CIAA
Martin Kutrib, Friedrich Otto
2012 J jnl
Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011).
RAIRO Theor. Informatics Appl.
Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano
2012 — conf
Systems of Parallel Communicating Restarting Automata.
NCMA
Marcel Vollweiler, Friedrich Otto
2011 J jnl
A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata.
Theory Comput. Syst.
Hartmut Messerschmidt, Friedrich Otto
2011 B conf
An Automata-Theoretical Characterization of Context-Free Trace Languages.
SOFSEM
Benedek Nagy, Friedrich Otto
2011 J jnl
CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store.
RAIRO Theor. Informatics Appl.
Benedek Nagy, Friedrich Otto
2011 C conf
Characterizing the Regular Languages by Nonforgetting Restarting Automata.
Developments in Language Theory
Norbert Hundeshagen, Friedrich Otto
2011 — conf
Deterministic Pushdown-CD-Systems of Stateless Deterministic R(1)-Automata.
AFL
Benedek Nagy, Friedrich Otto
2011 C conf
Globally Deterministic CD-Systems of Stateless R(1)-Automata.
LATA
Benedek Nagy, Friedrich Otto
2011 J jnl
On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems.
Fundam. Informaticae
Peter Leupold, Friedrich Otto
2011 — conf
On Restarting Automata with Window Size One.
DCFS
Friedrich Otto
2011 J jnl
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata.
Theor. Comput. Sci.
Dana Pardubská, Martin Plátek, Friedrich Otto
2011 J jnl
Preface.
Fundam. Informaticae
Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto
2011 — conf
Pushdown Automata with Translucent Pushdown Symbols.
NCMA
Benedek Nagy, Friedrich Otto, Marcel Vollweiler
2011 — ed.
Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18 - July 19, 2011. Proceedings
NCMA
Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano
2010 B conf
CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions.
SOFSEM
Friedrich Otto
2010 C conf
CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages.
LATA
Benedek Nagy, Friedrich Otto
2010 J jnl
On Alternating Phrase-Structure Grammars.
Int. J. Found. Comput. Sci.
Etsuro Moriya, Friedrich Otto
2010 C conf
On Lexicalized Well-Behaved Restarting Automata That Are Monotone.
Developments in Language Theory
Friedrich Otto, Martin Plátek, Frantisek Mráz
2010 — conf
On McNaughton Families of Languages Specified by Certain Variants of Monadic String-Rewriting Systems.
NCMA
Peter Leupold, Friedrich Otto
2010 J jnl
On Stateless Two-Pushdown Automata and Restarting Automata.
Int. J. Found. Comput. Sci.
Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto
2010 J jnl
On stateless deterministic restarting automata.
Acta Informatica
Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto
2010 — ed.
Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23 - August 24, 2010. Proceedings
NCMA
Henning Bordihn, Rudolf Freund, Markus Holzer, Thomas Hinze, Martin Kutrib, Friedrich Otto
2010 C conf
Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata.
CIAA
Norbert Hundeshagen, Friedrich Otto, Marcel Vollweiler
2009 J jnl
Left-to-right regular languages and two-way restarting automata.
RAIRO Theor. Informatics Appl.
Friedrich Otto
2009 J jnl
On Deterministic CD-Systems of Restarting Automata.
Int. J. Found. Comput. Sci.
Hartmut Messerschmidt, Friedrich Otto
2009 C conf
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata.
LATA
Dana Pardubská, Martin Plátek, Friedrich Otto
2009 B conf
On Stateless Deterministic Restarting Automata.
SOFSEM
Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto
2009 — conf
Parallel Communicating Grammar Systems with Regular Control.
CAI
Dana Pardubská, Martin Plátek, Friedrich Otto
2009 — conf
Single-Path Restarting Tree Automata.
CAI
Friedrich Otto, Heiko Stamer
2009 J jnl
The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages.
Theor. Comput. Sci.
Frantisek Mráz, Friedrich Otto, Martin Plátek
2009 J jnl
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata.
Inf. Comput.
Martin Plátek, Friedrich Otto, Frantisek Mráz
2009 — ed.
Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31 - September 1, 2009. Proceedings
NCMA
Henning Bordihn, Rudolf Freund, Markus Holzer, Martin Kutrib, Friedrich Otto
2008 C conf
A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata.
LATA
Friedrich Otto, Martin Plátek
2008 J jnl
Church-Rosser Groups and Growing Context-Sensitive Groups.
J. Autom. Lang. Comb.
Mark Kambites, Friedrich Otto
2008 C ed.
Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers
LATA
Carlos Martín-Vide, Friedrich Otto, Henning Fernau
2008 C conf
On Alternating Phrase-Structure Grammars.
LATA
Etsuro Moriya, Friedrich Otto
2008 — conf
On PCGS and FRR-automata.
ITAT
Dana Pardubská, Martin Plátek, Friedrich Otto
2008 — conf
On Stateless Two-Pushdown Automata and Restarting Automata.
AFL
Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto
2008 J jnl
On determinism versus nondeterminism for restarting automata.
Inf. Comput.
Hartmut Messerschmidt, Friedrich Otto
2008 J jnl
On the Complexity of 2-Monotone Restarting Automata.
Theory Comput. Syst.
Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
2007 C conf
A Measure for the Degree of Nondeterminism of Context-Free Languages.
CIAA
Frantisek Mráz, Martin Plátek, Friedrich Otto
2007 J jnl
Cooperating Distributed Systems of Restarting Automata.
Int. J. Found. Comput. Sci.
Hartmut Messerschmidt, Friedrich Otto
2007 C conf
Free Word-Order and Restarting Automata.
LATA
Frantisek Mráz, Friedrich Otto, Martin Plátek
2007 C conf
Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata.
MCU
Frantisek Mráz, Friedrich Otto, Martin Plátek
2007 C conf
On Determinism Versus Non-Determinism for Restarting Automata.
LATA
Hartmut Messerschmidt, Friedrich Otto
2007 — conf
Restarting Tree Automata and Linear Context-Free Tree Languages.
CAI
Heiko Stamer, Friedrich Otto
2007 — conf
Restarting Tree Automata.
SOFSEM (1)
Heiko Stamer, Friedrich Otto
2007 J jnl
Sequential monotonicity for restarting automata.
RAIRO Theor. Informatics Appl.
Tomasz Jurdzinski, Friedrich Otto
2007 J jnl
Shrinking Restarting Automata.
Int. J. Found. Comput. Sci.
Tomasz Jurdzinski, Friedrich Otto
2007 B conf
Strictly Deterministic CD-Systems of Restarting Automata.
FCT
Hartmut Messerschmidt, Friedrich Otto
2007 J jnl
Two Ways of Introducing Alternation into Context-Free Grammars and Pushdown Automata.
IEICE Trans. Inf. Syst.
Etsuro Moriya, Friedrich Otto
2006 C conf
Correctness Preservation and Complexity of Simple RL-Automata.
CIAA
Hartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek
2006 J jnl
Degrees of non-monotonicity for restarting automata.
Theor. Comput. Sci.
Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek
2006 — conf
Learning Analysis by Reduction from Positive Data.
ICGI
Frantisek Mráz, Friedrich Otto, Martin Plátek
2006 J jnl
Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata.
Theor. Comput. Sci.
Frantisek Mráz, Friedrich Otto, Martin Plátek, Tomasz Jurdzinski
2006 Misc conf
On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone.
CSR
Hartmut Messerschmidt, Friedrich Otto
2006 C conf
On the Gap-Complexity of Simple RL-Automata.
Developments in Language Theory
Frantisek Mráz, Friedrich Otto, Martin Plátek
2006 — ch.
Restarting Automata.
Recent Advances in Formal Languages and Applications
Friedrich Otto
2006 J jnl
Restarting automata with restricted utilization of auxiliary symbols.
Theor. Comput. Sci.
Tomasz Jurdzinski, Friedrich Otto
2005 J jnl
Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars.
Fundam. Informaticae
Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
2005 J jnl
Hierarchies of weakly monotone restarting automata.
RAIRO Theor. Informatics Appl.
Frantisek Mráz, Friedrich Otto
2005 C conf
Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols.
Developments in Language Theory
Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek
2005 J jnl
On state-alternating context-free grammars.
Theor. Comput. Sci.
Etsuro Moriya, Dieter Hofbauer, Maria Huber, Friedrich Otto
2005 C conf
Restricting the Use of Auxiliary Symbols for Restarting Automata.
CIAA
Tomasz Jurdzinski, Friedrich Otto
2005 B conf
Shrinking Multi-pushdown Automata.
FCT
Markus Holzer, Friedrich Otto
2005 B conf
Shrinking Restarting Automata.
MFCS
Tomasz Jurdzinski, Friedrich Otto
2005 J jnl
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages.
Inf. Comput.
Gundula Niemann, Friedrich Otto
2004 C conf
On Left-Monotone Deterministic Restarting Automata.
Developments in Language Theory
Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
2004 J jnl
On Oleshchuk's Public Key Cryptosystem.
IACR Cryptol. ePrint Arch.
Heiko Stamer, Friedrich Otto
2004 C conf
On the Complexity of 2-Monotone Restarting Automata.
Developments in Language Theory
Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
2004 J jnl
Reduction relations for monoid semirings.
J. Symb. Comput.
Friedrich Otto, Olga Sokratova
2004 J jnl
Shrinking Alternating Two-Pushdown Automata.
IEICE Trans. Inf. Syst.
Friedrich Otto, Etsuro Moriya
2004 J jnl
Some Results on RWW- and RRWW-Automata and their Relation to the Class of Growing Context-Sensitive Languages.
J. Autom. Lang. Comb.
Tomasz Jurdzinski, Krzysztof Lorys, Gundula Niemann, Friedrich Otto
2003 — conf
Church-Rosser Languages and Their Relationship to Other Language Classes.
Grammars and Automata for String Processing
Gundula Niemann, Friedrich Otto
2003 J jnl
McNaughton families of languages.
Theor. Comput. Sci.
Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto
2003 C conf
Restarting Automata and Their Relations to the Chomsky Hierarchy.
Developments in Language Theory
Friedrich Otto
2003 — conf
Restarting Automata and Variants of j-Monotonicity.
DCFS
Martin Plátek, Friedrich Otto, Frantisek Mráz
2003 J jnl
Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditions.
Theor. Comput. Sci.
Masashi Katsura, Yuji Kobayashi, Friedrich Otto
2002 J jnl
A Completion Procedure for Finitely Presented Groups That Is Based on Word Cycles.
J. Autom. Reason.
Robert Cremanns, Friedrich Otto
2002 J jnl
Some Exact Sequences for The Homotopy (Bi-)Module af A Monoid.
Int. J. Algebra Comput.
Yuji Kobayashi, Friedrich Otto
2001 J jnl
Confluent Monadic String-Rewriting Systems and Automatic Structures.
J. Autom. Lang. Comb.
Friedrich Otto, Nikola Ruskuc
2001 J jnl
On Homotopical and Homological Finiteness Conditions for Finitely Presented Monoids.
Int. J. Algebra Comput.
Yuji Kobayashi, Friedrich Otto
2001 — conf
On the Power of RRWW-Automata.
Words, Semigroups, and Transductions
Gundula Niemann, Friedrich Otto
2001 C conf
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy.
Developments in Language Theory
Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto
2000 — conf
Confluent Internal Contextual Languages.
Recent Topics in Mathematical and Computational Linguistics
Gundula Niemann, Friedrich Otto
2000 — conf
Further Results on Restarting Automata.
Words, Languages & Combinatorics
Gundula Niemann, Friedrich Otto
2000 J jnl
On Dehn Functions of Finitely Presented Bi-Automatic Monoids.
J. Autom. Lang. Comb.
Friedrich Otto
2000 J jnl
Repetitiveness of languages generated by morphisms.
Theor. Comput. Sci.
Yuji Kobayashi, Friedrich Otto
2000 J jnl
The Property Fdt is Undecidable for Finitely Presented Monoids that Have Polynomial-Time Decidable Word Problems.
Int. J. Algebra Comput.
Friedrich Otto, Andrea Sattler-Klein
2000 B conf
Undecidability Results for Monoids with Linear-Time Decidable Word Problems.
ISAAC
Masashi Katsura, Yuji Kobayashi, Friedrich Otto
1999 Misc conf
On S-Regular Prefix-Rewriting Systems and Automatic Structures.
COCOON
Friedrich Otto
1999 — conf
On the Connections between Rewriting and Formal Language Theory.
RTA
Friedrich Otto
1999 C conf
Restarting automata, Church-Rosser languages, and representations of r.e. languages.
Developments in Language Theory
Gundula Niemann, Friedrich Otto
1998 — conf
Automatic Monoids Versus Monoids with Finite Convergent Presentations.
RTA
Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener
1998 J jnl
Equational Unification, Word Unification, and 2nd-Order Equational Unification.
Theor. Comput. Sci.
Friedrich Otto, Paliath Narendran, Daniel J. Dougherty
1998 J jnl
Growing Context-Sensitive Languages and Church-Rosser Languages.
Inf. Comput.
Gerhard Buntrock, Friedrich Otto
1998 J jnl
Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented Monoids.
J. Symb. Comput.
Friedrich Otto, Masashi Katsura, Yuji Kobayashi
1998 J jnl
Some Undecidability Results Concerning the Property of Preserving Regularity.
Theor. Comput. Sci.
Friedrich Otto
1998 B conf
The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages.
FoSSaCS
Gundula Niemann, Friedrich Otto
1997 Misc conf
A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet.
COCOON
Yuji Kobayashi, Friedrich Otto, Patrice Séébold
1997 — conf
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems.
RTA
Friedrich Otto, Masashi Katsura, Yuji Kobayashi
1997 B conf
FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems.
FCT
Friedrich Otto, Andrea Sattler-Klein
1997 — conf
On the Property of Preserving Regularity for String-Rewriting Systems.
RTA
Friedrich Otto
1997 — conf
Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems - A Survey.
Advances in Algorithms, Languages, and Complexity
Friedrich Otto, Yuji Kobayashi
1997 B conf
Repetitiveness of D0L-Languages Is Decidable in Polynomial Time.
MFCS
Yuji Kobayashi, Friedrich Otto
1997 J jnl
Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories.
J. Autom. Reason.
Paliath Narendran, Friedrich Otto
1997 J jnl
Some Undecidability Results for Finitely Generated Thue Congruences on aTwo-Letter Alphabet.
Fundam. Informaticae
Klaus Madlener, Friedrich Otto
1997 A* conf
The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent.
ICALP
Paliath Narendran, Friedrich Otto
1996 J jnl
For Groups the Property of Having Finite Derivation Type is Equivalent to the Homological Finiteness Condition FP_3.
J. Symb. Comput.
Robert Cremanns, Friedrich Otto
1995 A conf
Growing Context-Sensitive Languages and Church-Rosser Languages.
STACS
Gerhard Buntrock, Friedrich Otto
1995 J jnl
On Confluence Versus Strong Confluence for One-Rule Trace-Rewriting Systems.
Math. Syst. Theory
Friedrich Otto
1995 J jnl
Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General.
Inf. Process. Lett.
Friedrich Otto
1995 — conf
Some Independent Results for Equational Unification.
RTA
Friedrich Otto, Paliath Narendran, Daniel J. Dougherty
1994 J jnl
A Finiteness Condition for Rewriting Systems.
Theor. Comput. Sci.
Craig C. Squier, Friedrich Otto, Yuji Kobayashi
1994 J jnl
Codes Modulo Finite Monadic String-Rewriting Systems.
Theor. Comput. Sci.
Friedrich Otto, Paliath Narendran
1994 J jnl
Computing Presentations for Subgroups of Polycyclic Groups and of Context-Free Groups.
Appl. Algebra Eng. Commun. Comput.
Norbert Kuhn, Klaus Madlener, Friedrich Otto
1994 B conf
Constructing Canonical Presentations for Subgroups of Context-Free Groups in Polynomial Time (extended abstract).
ISSAC
Robert Cremanns, Friedrich Otto
1994 J jnl
Finite Derivation Type Implies the Homological Finiteness Condition FP_3.
J. Symb. Comput.
Robert Cremanns, Friedrich Otto
1993 J jnl
On Weakly Confluent Monadic String-Rewriting Systems.
Theor. Comput. Sci.
Klaus Madlener, Paliath Narendran, Friedrich Otto, Louxin Zhang
1993 J jnl
On the Problem of Generating Small Convergent Systems.
J. Symb. Comput.
Klaus Madlener, Andrea Sattler-Klein, Friedrich Otto
1993 J jnl
Separating the Intrinsic Complexity and the Derivational complexity of the Word Problem for Finitely Presented Groups.
Math. Log. Q.
Friedrich Otto, Daniel E. Cohen, Klaus Madlener
1993 — book
String-Rewriting Systems.
Ronald V. Book, Friedrich Otto
1992 B conf
Computing Presentations for Subgroups of Context-Free Groups.
ISSAC
Norbert Kuhn, Klaus Madlener, Friedrich Otto
1992 B conf
Generating Small Convergent Systems Can Be Extremely Hard.
ISAAC
Klaus Madlener, Friedrich Otto, Andrea Sattler-Klein
1992 B conf
One-Rule Trace-Rewriting Systems and Confluence.
MFCS
Celia Wrathall, Volker Diekert, Friedrich Otto
1992 J jnl
The Problem of Deciding Confluence on a Given Congruence Class is Tractable for Finite Special String-Rewriting Systems.
Math. Syst. Theory
Friedrich Otto
1991 A* conf
A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups.
ICALP
Klaus Madlener, Paliath Narendran, Friedrich Otto
1991 J jnl
Completing a Finite Special String-Rewriting System on the Congruence Class of the Empty Word.
Appl. Algebra Eng. Commun. Comput.
Friedrich Otto
1991 A conf
Decidable Sentences for Context-Free Groups.
STACS
Klaus Madlener, Friedrich Otto
1991 J jnl
Decision Problems for Finite Special String-Rewriting Systems that are Confluent on Some Congruence Class.
Acta Informatica
Friedrich Otto, Louxin Zhang
1991 J jnl
It is undecidable whether a finite special string-rewriting system presents a group.
Discret. Math.
Paliath Narendran, Colm Ó'Dúnlaing, Friedrich Otto
1991 J jnl
Overlaps in Free Partially Commutative Monoids.
J. Comput. Syst. Sci.
Friedrich Otto, Celia Wrathall
1991 — conf
Some Undecidability Results for Weakly Confluent Monadic String-Rewriting Systems.
AAECC
Friedrich Otto
1991 J jnl
When is an Extension of a Specification Consistent? Decidable and Undecidable Cases.
J. Symb. Comput.
Friedrich Otto
1990 B conf
A Test for lambda-Confluence for Certain Prefix Rewriting Systems with Applications to the Generalized Word Problem.
ISSAC
Norbert Kuhn, Klaus Madlener, Friedrich Otto
1990 J jnl
On Ground-Confluence of Term Rewriting Systems
Inf. Comput.
Deepak Kapur, Paliath Narendran, Friedrich Otto
1990 A conf
Some Results on Equational Unification.
CADE
Paliath Narendran, Friedrich Otto
1989 J jnl
About the Descriptive Power of Certain Classes of Finite String-Rewriting Systems.
Theor. Comput. Sci.
Klaus Madlener, Friedrich Otto
1989 J jnl
On Deciding Confluence of Finite String-Rewriting Systems Modulo Partial Commutativity.
Theor. Comput. Sci.
Friedrich Otto
1989 — conf
Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems.
RTA
Friedrich Otto
1989 J jnl
Some Polynomial-Time Algorithms for Finite Monadic Church-Rosser Thue Systems.
Theor. Comput. Sci.
Paliath Narendran, Friedrich Otto
1988 J jnl
An example of a one-relator group that is not a one-relation monoid.
Discret. Math.
Friedrich Otto
1988 J jnl
Church-Rosser Thue systems and formal languages.
J. ACM
Robert McNaughton, Paliath Narendran, Friedrich Otto
1988 J jnl
Commutativity in Groups Presented By Finite Church-Rosser Thue Systems.
RAIRO Theor. Informatics Appl.
Klaus Madlener, Friedrich Otto
1988 J jnl
Elements of Finite Order for Finite Weight-Reducing and Confluent Thue Systems.
Acta Informatica
Paliath Narendran, Friedrich Otto
1988 J jnl
Preperfectness is Undecidable for Thue Systems Containing Only Length-Reducing Rules and a Single Commutation Rule.
Inf. Process. Lett.
Paliath Narendran, Friedrich Otto
1988 J jnl
Pseudo-Natural Algorithms for Finitely Generated Presentations of Monoids and Groups.
J. Symb. Comput.
Klaus Madlener, Friedrich Otto
1987 J jnl
Finite Canonical Rewriting Systems for Congruences Generated by Concurrency Relations.
Math. Syst. Theory
Friedrich Otto
1987 — conf
Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems.
RTA
Klaus Madlener, Friedrich Otto
1987 — conf
It is Decidable in Polynomial Time Whether a Monoid Presented by a Finite Weight-Reducing and Confluent Thue System is Torsion-Free.
AAECC
Paliath Narendran, Friedrich Otto
1987 J jnl
On Deciding the Confluence of a Finite String-Rewriting System on a Given Congruence Class.
J. Comput. Syst. Sci.
Friedrich Otto
1987 — conf
Some Results about Confluence on a Given Congruence Class.
RTA
Friedrich Otto
1987 — conf
Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems.
RTA
Craig C. Squier, Friedrich Otto
1987 J jnl
Using String-Rewriting for Solving the Word Problem for Finitely Presented Groups.
Inf. Process. Lett.
Klaus Madlener, Friedrich Otto
1986 J jnl
Church-Rosser Thue Systems that Present Free Monoids.
SIAM J. Comput.
Friedrich Otto
1986 J jnl
On Deciding Whether a Monoid is a Free Monoid or is a Group.
Acta Informatica
Friedrich Otto
1986 J jnl
The Problems of Cyclic Equality and Conjugacy for Finite Complete Rewriting Systems.
Theor. Comput. Sci.
Paliath Narendran, Friedrich Otto
1986 J jnl
The Undecidability of Self-Embedding for Finite Semi-Thue and Thue Systems.
Theor. Comput. Sci.
Friedrich Otto
1985 J jnl
A Note on Thue Systems with a Single Defining Relation.
Math. Syst. Theory
Friedrich Otto, Celia Wrathall
1985 J jnl
Cancellation Rules and Extended Word Problems.
Inf. Process. Lett.
Ronald V. Book, Friedrich Otto
1985 J jnl
Classes of regular and context-free languages over countably infinite alphabets.
Discret. Appl. Math.
Friedrich Otto
1985 J jnl
Complexity Results on the Conjugacy Problem for Monoids.
Theor. Comput. Sci.
Paliath Narendran, Friedrich Otto
1985 — conf
Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems.
RTA
Friedrich Otto
1985 J jnl
On the Security of Name-Stamp Protocols.
Theor. Comput. Sci.
Ronald V. Book, Friedrich Otto
1985 J jnl
On the Verifiability of Two-Party Algebraic Protocols.
Theor. Comput. Sci.
Ronald V. Book, Friedrich Otto
1985 J jnl
Pseudo-Natural Algorithms for the Word Problem for Finitely Presented Monoids and Groups.
J. Symb. Comput.
Klaus Madlener, Friedrich Otto
1985 A* conf
The Verifiability of Two-Party Protocols.
EUROCRYPT
Ronald V. Book, Friedrich Otto
1984 J jnl
Finite Complete Rewriting Systems and the Complexity of the Word Problem.
Acta Informatica
G. Bauer, Friedrich Otto
1984 J jnl
Finite Complete Rewriting Systems for the Jantzen Monoid and the Greendlinger Group.
Theor. Comput. Sci.
Friedrich Otto
1984 J jnl
Some Undecidability Results for Non-Monadic Church-Rosser Thue Systems.
Theor. Comput. Sci.
Friedrich Otto
1984 J jnl
The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems is NP-Complete
Inf. Control.
Paliath Narendran, Friedrich Otto, Karl Winklmann