| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Benedek Nagy, Friedrich Otto |
On CD-systems of stateless deterministic R-automata with window size one.  |
J. Comput. Syst. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Norbert Hundeshagen, Friedrich Otto |
Characterizing the Rational Functions by Restarting Transducers. |
LATA |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Pardubská, Martin Plátek, Friedrich Otto |
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto |
Preface. |
Fundam. Inform. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Leupold, Friedrich Otto |
On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems. |
Fundam. Inform. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Messerschmidt, Friedrich Otto |
A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benedek Nagy, Friedrich Otto |
Globally Deterministic CD-Systems of Stateless R(1)-Automata. |
LATA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Norbert Hundeshagen, Friedrich Otto |
Characterizing the Regular Languages by Nonforgetting Restarting Automata. |
Developments in Language Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano (eds.) |
Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18 - July 19, 2011. Proceedings |
NCMA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benedek Nagy, Friedrich Otto, Marcel Vollweiler |
Pushdown Automata with Translucent Pushdown Symbols. |
NCMA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benedek Nagy, Friedrich Otto |
Deterministic Pushdown-CD-Systems of Stateless Deterministic R(1)-Automata. |
AFL |
2011 |
DBLP BibTeX RDF |
|
| 1 | Friedrich Otto |
On Restarting Automata with Window Size One. |
DCFS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benedek Nagy, Friedrich Otto |
An Automata-Theoretical Characterization of Context-Free Trace Languages. |
SOFSEM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto |
On Stateless Two-Pushdown Automata and Restarting Automata. |
Int. J. Found. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Etsuro Moriya, Friedrich Otto |
On Alternating Phrase-Structure Grammars. |
Int. J. Found. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto |
On stateless deterministic restarting automata. |
Acta Inf. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benedek Nagy, Friedrich Otto |
CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages. |
LATA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto, Martin Plátek, Frantisek Mráz |
On Lexicalized Well-Behaved Restarting Automata That Are Monotone. |
Developments in Language Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Rudolf Freund, Markus Holzer, Thomas Hinze, Martin Kutrib, Friedrich Otto (eds.) |
Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23 - August 24, 2010. Proceedings |
NCMA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Peter Leupold, Friedrich Otto |
On McNaughton Families of Languages Specified by Certain Variants of Monadic String-Rewriting Systems. |
NCMA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Friedrich Otto |
CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions. |
SOFSEM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Norbert Hundeshagen, Friedrich Otto, Marcel Vollweiler |
Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata. |
CIAA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frantisek Mráz, Friedrich Otto, Martin Plátek |
The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto |
Left-to-right regular languages and two-way restarting automata. |
ITA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Messerschmidt, Friedrich Otto |
On Deterministic CD-Systems of Restarting Automata. |
Int. J. Found. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Plátek, Friedrich Otto, Frantisek Mráz |
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata. |
Inf. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto, Heiko Stamer |
Single-Path Restarting Tree Automata. |
CAI |
2009 |
DBLP DOI BibTeX RDF |
restarting tree automaton, single-path top-down tree automaton, classes of tree languages, linear context-free tree language |
| 1 | Dana Pardubská, Martin Plátek, Friedrich Otto |
Parallel Communicating Grammar Systems with Regular Control. |
CAI |
2009 |
DBLP DOI BibTeX RDF |
parallel communicating grammar system, regular control, bounded communication complexity, freely rewriting restarting automaton |
| 1 | Dana Pardubská, Martin Plátek, Friedrich Otto |
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata. |
LATA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bordihn, Rudolf Freund, Markus Holzer, Martin Kutrib, Friedrich Otto (eds.) |
Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31 - September 1, 2009. Proceedings |
NCMA |
2009 |
DBLP BibTeX RDF |
|
| 1 | Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto |
On Stateless Deterministic Restarting Automata. |
SOFSEM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Messerschmidt, Friedrich Otto |
On determinism versus nondeterminism for restarting automata. |
Inf. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek |
On the Complexity of 2-Monotone Restarting Automata. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Restarting automaton, Growing context-sensitive language, completeness, Monotonicity |
| 1 | Etsuro Moriya, Friedrich Otto |
On Alternating Phrase-Structure Grammars. |
LATA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto, Martin Plátek |
A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata. |
LATA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Carlos Martín-Vide, Friedrich Otto, Henning Fernau (eds.) |
Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers |
LATA |
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto |
On Stateless Two-Pushdown Automata and Restarting Automata. |
AFL |
2008 |
DBLP BibTeX RDF |
|
| 1 | Tomasz Jurdzinski, Friedrich Otto |
Sequential monotonicity for restarting automata. |
ITA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Messerschmidt, Friedrich Otto |
Cooperating Distributed Systems of Restarting Automata. |
Int. J. Found. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Jurdzinski, Friedrich Otto |
Shrinking Restarting Automata. |
Int. J. Found. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Etsuro Moriya, Friedrich Otto |
Two Ways of Introducing Alternation into Context-Free Grammars and Pushdown Automata. |
IEICE Transactions |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Heiko Stamer, Friedrich Otto |
Restarting Tree Automata and Linear Context-Free Tree Languages. |
CAI |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Messerschmidt, Friedrich Otto |
On Determinism Versus Non-Determinism for Restarting Automata. |
LATA |
2007 |
DBLP BibTeX RDF |
|
| 1 | Frantisek Mráz, Friedrich Otto, Martin Plátek |
Free Word-Order and Restarting Automata. |
LATA |
2007 |
DBLP BibTeX RDF |
|
| 1 | Frantisek Mráz, Friedrich Otto, Martin Plátek |
Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata. |
MCU |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Messerschmidt, Friedrich Otto |
Strictly Deterministic CD-Systems of Restarting Automata. |
FCT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Heiko Stamer, Friedrich Otto |
Restarting Tree Automata. |
SOFSEM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frantisek Mráz, Martin Plátek, Friedrich Otto |
A Measure for the Degree of Nondeterminism of Context-Free Languages. |
CIAA |
2007 |
DBLP DOI BibTeX RDF |
measure of nondeterminism, restarting automaton, analysis by reduction |
| 1 | Tomasz Jurdzinski, Friedrich Otto |
Restarting automata with restricted utilization of auxiliary symbols. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Frantisek Mráz, Friedrich Otto, Martin Plátek, Tomasz Jurdzinski |
Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek |
Degrees of non-monotonicity for restarting automata. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto |
Restarting Automata. |
Recent Advances in Formal Languages and Applications |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Messerschmidt, Friedrich Otto |
On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone. |
CSR |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Frantisek Mráz, Friedrich Otto, Martin Plátek |
On the Gap-Complexity of Simple RL-Automata. |
Developments in Language Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Frantisek Mráz, Friedrich Otto, Martin Plátek |
Learning Analysis by Reduction from Positive Data. |
ICGI |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek |
Correctness Preservation and Complexity of Simple RL-Automata. |
CIAA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Etsuro Moriya, Dieter Hofbauer, Maria Huber, Friedrich Otto |
On state-alternating context-free grammars. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Frantisek Mráz, Friedrich Otto |
Hierarchies of weakly monotone restarting automata. |
ITA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gundula Niemann, Friedrich Otto |
The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. |
Inf. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek |
Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars. |
Fundam. Inform. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Tomasz Jurdzinski, Friedrich Otto |
Shrinking Restarting Automata. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Friedrich Otto |
Shrinking Multi-pushdown Automata. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek |
Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols. |
Developments in Language Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Jurdzinski, Friedrich Otto |
Restricting the Use of Auxiliary Symbols for Restarting Automata. |
CIAA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto, Olga Sokratova |
Reduction relations for monoid semirings. |
J. Symb. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto, Etsuro Moriya |
Shrinking Alternating Two-Pushdown Automata. |
IEICE Transactions |
2004 |
DBLP BibTeX RDF |
|
| 1 | Heiko Stamer, Friedrich Otto |
On Oleshchuk's Public Key Cryptosystem. |
IACR Cryptology ePrint Archive |
2004 |
DBLP BibTeX RDF |
|
| 1 | Friedrich Otto |
Some Results on RWW- and RRWW-Automata and their Relation to the Class of Growing Context-Sensitive Languages. |
Journal of Automata, Languages and Combinatorics |
2004 |
DBLP BibTeX RDF |
|
| 1 | Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek |
On the Complexity of 2-Monotone Restarting Automata. |
Developments in Language Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek |
On Left-Monotone Deterministic Restarting Automata. |
Developments in Language Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto |
McNaughton families of languages. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Masashi Katsura, Yuji Kobayashi, Friedrich Otto |
Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditions. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto |
Restarting Automata and Their Relations to the Chomsky Hierarchy. |
Developments in Language Theory |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gundula Niemann, Friedrich Otto |
Church-Rosser Languages and Their Relationship to Other Language Classes. |
Grammars and Automata for String Processing |
2003 |
DBLP BibTeX RDF |
|
| 1 | Martin Plátek, Friedrich Otto, Frantisek Mráz |
Restarting Automata and Variants of j-Monotonicity. |
DCFS |
2003 |
DBLP BibTeX RDF |
|
| 1 | Yuji Kobayashi, Friedrich Otto |
Some Exact Sequences for The Homotopy (Bi-)Module af A Monoid. |
IJAC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Cremanns, Friedrich Otto |
A Completion Procedure for Finitely Presented Groups That Is Based on Word Cycles. |
J. Autom. Reasoning |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuji Kobayashi, Friedrich Otto |
On Homotopical and Homological Finiteness Conditions for Finitely Presented Monoids. |
IJAC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto, Nikola Ruskuc |
Confluent Monadic String-Rewriting Systems and Automatic Structures. |
Journal of Automata, Languages and Combinatorics |
2001 |
DBLP BibTeX RDF |
|
| 1 | Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto |
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy. |
Developments in Language Theory |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Gundula Niemann, Friedrich Otto |
On the Power of RRWW-Automata. |
Words, Semigroups, and Transductions |
2001 |
DBLP BibTeX RDF |
|
| 1 | Yuji Kobayashi, Friedrich Otto |
Repetitiveness of languages generated by morphisms. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto, Andrea Sattler-Klein |
The Property Fdt is Undecidable for Finitely Presented Monoids that Have Polynomial-Time Decidable Word Problems. |
IJAC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto |
On Dehn Functions of Finitely Presented Bi-Automatic Monoids. |
Journal of Automata, Languages and Combinatorics |
2000 |
DBLP BibTeX RDF |
|
| 1 | Gundula Niemann, Friedrich Otto |
Further Results on Restarting Automata. |
Words, Languages & Combinatorics |
2000 |
DBLP BibTeX RDF |
|
| 1 | Gundula Niemann, Friedrich Otto |
Confluent Internal Contextual Languages. |
Recent Topics in Mathematical and Computational Linguistics |
2000 |
DBLP BibTeX RDF |
|
| 1 | Masashi Katsura, Yuji Kobayashi, Friedrich Otto |
Undecidability Results for Monoids with Linear-Time Decidable Word Problems. |
ISAAC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Gundula Niemann, Friedrich Otto |
Restarting automata, Church-Rosser languages, and representations of r.e. languages. |
Developments in Language Theory |
1999 |
DBLP BibTeX RDF |
|
| 1 | Friedrich Otto |
On the Connections between Rewriting and Formal Language Theory. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto |
On S-Regular Prefix-Rewriting Systems and Automatic Structures. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto, Paliath Narendran, Daniel J. Dougherty |
Equational Unification, Word Unification, and 2nd-Order Equational Unification. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto |
Some Undecidability Results Concerning the Property of Preserving Regularity. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto, Masashi Katsura, Yuji Kobayashi |
Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented Monoids. |
J. Symb. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard Buntrock, Friedrich Otto |
Growing Context-Sensitive Languages and Church-Rosser Languages. |
Inf. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener |
Automatic Monoids Versus Monoids with Finite Convergent Presentations. |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Gundula Niemann, Friedrich Otto |
The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages. |
FoSSaCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Madlener, Friedrich Otto |
Some Undecidability Results for Finitely Generated Thue Congruences on aTwo-Letter Alphabet. |
Fundam. Inform. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Paliath Narendran, Friedrich Otto |
Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories. |
J. Autom. Reasoning |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Paliath Narendran, Friedrich Otto |
The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent. |
ICALP |
1997 |
DBLP DOI BibTeX RDF |
matching, unification, equational theory, string-rewriting systems |
| 1 | Yuji Kobayashi, Friedrich Otto |
Repetitiveness of D0L-Languages Is Decidable in Polynomial Time. |
MFCS |
1997 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")