Friedrich Otto - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

Transductions Computed by PC-Systems of Monotone Deterministic Restarting AutomataNorbert Hundeshagen, Friedrich Otto, Marcel Vollweiler. wia 2011: 163-172 [doi]

On Stateless Two-Pushdown Automata and Restarting AutomataMartin Kutrib, Hartmut Messerschmidt, Friedrich Otto. ijfcs, 21(5):781-798, 2010. [doi]

On stateless deterministic restarting automataMartin Kutrib, Hartmut Messerschmidt, Friedrich Otto. ACTA, 47(7-8):391-412, 2010. [doi]

On Alternating Phrase-Structure GrammarsEtsuro Moriya, Friedrich Otto. ijfcs, 21(1):1-25, 2010. [doi]

CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace LanguagesBenedek Nagy, Friedrich Otto. LATA 2010: 463-474 [doi]

CD-Systems of Restarting Automata Governed by Explicit Enable and Disable ConditionsFriedrich Otto. sofsem 2010: 627-638 [doi]

On Lexicalized Well-Behaved Restarting Automata That Are MonotoneFriedrich Otto, Martin Plátek, Frantisek Mráz. dlt 2010: 352-363 [doi]

2009

On Stateless Deterministic Restarting AutomataMartin Kutrib, Hartmut Messerschmidt, Friedrich Otto. sofsem 2009: 353-364 [doi]

On Deterministic CD-Systems of Restarting AutomataHartmut Messerschmidt, Friedrich Otto. ijfcs, 20(1):185-209, 2009. [doi]

The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languagesFrantisek MrÃ¡z, Friedrich Otto, Martin PlÃ¡tek. TCS, 410(37):3530-3538, 2009. [doi]

Left-to-right regular languages and two-way restarting automataFriedrich Otto. ita, 43(3):653-665, 2009. [doi]

Single-Path Restarting Tree AutomataFriedrich Otto, Heiko Stamer. cai 2009: 324-341 [doi]

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting AutomataDana Pardubská, Martin Plátek, Friedrich Otto. LATA 2009: 660-671 [doi]

Parallel Communicating Grammar Systems with Regular ControlDana PardubskÃ¡, Martin PlÃ¡tek, Friedrich Otto. cai 2009: 342-360 [doi]

Two-dimensional hierarchies of proper languages of lexicalized FRR-automataMartin PlÃ¡tek, Friedrich Otto, Frantisek MrÃ¡z. iandc, 207(11):1300-1314, 2009. [doi]

2008

On the Complexity of 2-Monotone Restarting AutomataTomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek. mst, 42(4):488-518, 2008. [doi]

Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised PapersCarlos Martín-Vide, Friedrich Otto, Henning Fernau, editors, Volume 5196 of Lecture Notes in Computer Science, Springer, 2008.

On determinism versus nondeterminism for restarting automataHartmut Messerschmidt, Friedrich Otto. iandc, 206(9-10):1204-1218, 2008. [doi]

On Alternating Phrase-Structure GrammarsEtsuro Moriya, Friedrich Otto. LATA 2008: 397-408 [doi]

A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-AutomataFriedrich Otto, Martin Plátek. LATA 2008: 409-420 [doi]

2007

Shrinking Restarting AutomataTomasz Jurdzinski, Friedrich Otto. ijfcs, 18(2):361-385, 2007. [doi]

Sequential monotonicity for restarting automataTomasz Jurdzinski, Friedrich Otto. ita, 41(2):157-175, 2007. [doi]

Strictly Deterministic CD-Systems of Restarting AutomataHartmut Messerschmidt, Friedrich Otto. fct 2007: 424-434 [doi]

Cooperating Distributed Systems of Restarting AutomataHartmut Messerschmidt, Friedrich Otto. ijfcs, 18(6):1333-1342, 2007. [doi]

Two Ways of Introducing Alternation into Context-Free Grammars and Pushdown AutomataEtsuro Moriya, Friedrich Otto. ieicet, 90-D(6):889-894, 2007. [doi]

Hierarchical Relaxations of the Correctness Preserving Property for Restarting AutomataFrantisek Mráz, Friedrich Otto, Martin Plátek. mcu 2007: 230-241 [doi]

A Measure for the Degree of Nondeterminism of Context-Free LanguagesFrantisek Mráz, Martin Plátek, Friedrich Otto. wia 2007: 192-202 [doi]

Restarting Tree AutomataHeiko Stamer, Friedrich Otto. sofsem 2007: 510-521 [doi]

Restarting Tree Automata and Linear Context-Free Tree LanguagesHeiko Stamer, Friedrich Otto. cai 2007: 275-289 [doi]

2006

Degrees of non-monotonicity for restarting automataTomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek. TCS, 369(1-3):1-34, 2006. [doi]

Restarting automata with restricted utilization of auxiliary symbolsTomasz Jurdzinski, Friedrich Otto. TCS, 363(2):162-181, 2006. [doi]

Correctness Preservation and Complexity of Simple RL-AutomataHartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek. wia 2006: 162-172 [doi]

On Nonforgetting Restarting Automata That Are Deterministic and/or MonotoneHartmut Messerschmidt, Friedrich Otto. csr 2006: 247-258 [doi]

On the Gap-Complexity of Simple RL-AutomataFrantisek Mráz, Friedrich Otto, Martin Plátek. dlt 2006: 83-94 [doi]

Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automataFrantisek Mráz, Friedrich Otto, Martin Plátek, Tomasz Jurdzinski. TCS, 366(3):272-296, 2006. [doi]

Learning Analysis by Reduction from Positive DataFrantisek Mráz, Friedrich Otto, Martin Plátek. icgi 2006: 125-136 [doi]

Restarting AutomataFriedrich Otto. In Zoltán Ésik, Carlos Martín-Vide, Victor Mitrana, editors, Recent Advances in Formal Languages and Applications. Volume 25 of Studies in Computational Intelligence, pages 269-303, Springer, 2006. [doi]

2005

Shrinking Multi-pushdown AutomataMarkus Holzer, Friedrich Otto. fct 2005: 305-316 [doi]

Monotone Deterministic RL-Automata Don t Need Auxiliary SymbolsTomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek. dlt 2005: 284-295 [doi]

Shrinking Restarting AutomataTomasz Jurdzinski, Friedrich Otto. mfcs 2005: 532-543 [doi]

Restricting the Use of Auxiliary Symbols for Restarting AutomataTomasz Jurdzinski, Friedrich Otto. wia 2006: 176-187 [doi]

Deterministic Two-Way Restarting Automata and Marcus Contextual GrammarsTomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek. FUIN, 64(1-4):217-228, 2005. [doi]

On state-alternating context-free grammarsEtsuro Moriya, Dieter Hofbauer, Maria Huber, Friedrich Otto. TCS, 337(1-3):183-216, 2005. [doi]

Hierarchies of weakly monotone restarting automataFrantisek MrÃ¡z, Friedrich Otto. ita, 39(2):325-342, 2005. [doi]

The Church-Rosser languages are the deterministic variants of the growing context-sensitive languagesGundula Niemann, Friedrich Otto. iandc, 197(1-2):1-21, 2005. [doi]

2004

2003

2002

A Completion Procedure for Finitely Presented Groups That Is Based on Word CyclesRobert Cremanns, Friedrich Otto. JAR, 28(3):235-256, 2002.

Some Exact Sequences for The Homotopy (Bi-)Module af A MonoidYuji Kobayashi, Friedrich Otto. ijac, 12(1-2):247-283, 2002. [doi]

2001

2000

1999

Restarting automata, Church-Rosser languages, and representations of r.e. languagesGundula Niemann, Friedrich Otto. dlt 2000: 103-114

On S-Regular Prefix-Rewriting Systems and Automatic StructuresFriedrich Otto. cocoon 1999: 422-431 [doi]

On the Connections between Rewriting and Formal Language TheoryFriedrich Otto. RTA 1999: 332-355 [doi]

1998

Growing Context-Sensitive Languages and Church-Rosser LanguagesGerhard Buntrock, Friedrich Otto. iandc, 141(1):1-36, 1998.

The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive LanguagesGundula Niemann, Friedrich Otto. fossacs 1998: 243-257 [doi]

Equational Unification, Word Unification, and 2nd-Order Equational UnificationFriedrich Otto, Paliath Narendran, Daniel J. Dougherty. TCS, 198(1-2):1-47, 1998. [doi]

Automatic Monoids Versus Monoids with Finite Convergent PresentationsFriedrich Otto, Andrea Sattler-Klein, Klaus Madlener. RTA 1998: 32-46 [doi]

Some Undecidability Results Concerning the Property of Preserving RegularityFriedrich Otto. TCS, 207(1):43-72, 1998. [doi]

Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented MonoidsFriedrich Otto, Masashi Katsura, Yuji Kobayashi. JSC, 26(5):621-648, 1998.

1997

Repetitiveness of D0L-Languages Is Decidable in Polynomial TimeYuji Kobayashi, Friedrich Otto. mfcs 1997: 337-346

A Complete Characterization of Repetitive Morphisms over the Two-Letter AlphabetYuji Kobayashi, Friedrich Otto, Patrice Séébold. cocoon 1997: 393-402

Some Undecidability Results for Finitely Generated Thue Congruences on aTwo-Letter AlphabetKlaus Madlener, Friedrich Otto. FUIN, 30(1):31-44, 1997.

Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting TheoriesPaliath Narendran, Friedrich Otto. JAR, 19(1):87-115, 1997.

The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are ConfluentPaliath Narendran, Friedrich Otto. icalp 1997: 638-648

Cross-Sections for Finitely Presented Monoids with Decidable Word ProblemsFriedrich Otto, Masashi Katsura, Yuji Kobayashi. RTA 1997: 53-67

FDT is Undecidable for Finitely Presented Monoids with Solvable Word ProblemsFriedrich Otto, Andrea Sattler-Klein. fct 1997: 388-399

On the Property of Preserving Regularity for String-Rewriting SystemsFriedrich Otto. RTA 1997: 83-97

Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems - A SurveyFriedrich Otto, Yuji Kobayashi. BIRTHDAY 1997: 225-266

1996

For Groups the Property of Having Finite Derivation Type is Equivalent to the Homological Finiteness Condition FP_3Robert Cremanns, Friedrich Otto. JSC, 22(2):155-177, 1996.

1995

Growing Context-Sensitive Languages and Church-Rosser LanguagesGerhard Buntrock, Friedrich Otto. STACS 1995: 313-324

Some Independent Results for Equational UnificationFriedrich Otto, Paliath Narendran, Daniel J. Dougherty. RTA 1995: 367-381

Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in GeneralFriedrich Otto. ipl, 53(5):237-242, 1995. [doi]

On Confluence Versus Strong Confluence for One-Rule Trace-Rewriting SystemsFriedrich Otto. mst, 28(4):363-384, 1995.

1994

1993

On the Problem of Generating Small Convergent SystemsKlaus Madlener, Andrea Sattler-Klein, Friedrich Otto. JSC, 16(2):167-187, 1993.

PreviousNext