The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Friedrich Otto: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paliath Narendran, Friedrich Otto
    It is Decidable in Polynomial Time Whether a Monoid Presented by a Finite Weight-Reducing and Confluent Thue System is Torsion-Free. [Citation Graph (0, 0)][DBLP]
    AAECC, 1987, pp:341-349 [Conf]
  2. Friedrich Otto
    Some Undecidability Results for Weakly Confluent Monadic String-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    AAECC, 1991, pp:292-303 [Conf]
  3. Gundula Niemann, Friedrich Otto
    Confluent Internal Contextual Languages. [Citation Graph (0, 0)][DBLP]
    Recent Topics in Mathematical and Computational Linguistics, 2000, pp:234-244 [Conf]
  4. Gundula Niemann, Friedrich Otto
    On the Power of RRWW-Automata. [Citation Graph (0, 0)][DBLP]
    Words, Semigroups, and Transductions, 2001, pp:341-355 [Conf]
  5. Gundula Niemann, Friedrich Otto
    Church-Rosser Languages and Their Relationship to Other Language Classes. [Citation Graph (0, 0)][DBLP]
    Grammars and Automata for String Processing, 2003, pp:295-304 [Conf]
  6. Friedrich Otto, Yuji Kobayashi
    Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems - A Survey. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:225-266 [Conf]
  7. Paliath Narendran, Friedrich Otto
    Some Results on Equational Unification. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:276-291 [Conf]
  8. Yuji Kobayashi, Friedrich Otto, Patrice Séébold
    A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:393-402 [Conf]
  9. Friedrich Otto
    On S-Regular Prefix-Rewriting Systems and Automatic Structures. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:422-431 [Conf]
  10. Hartmut Messerschmidt, Friedrich Otto
    On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:247-258 [Conf]
  11. Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto
    On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:340-348 [Conf]
  12. Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek
    Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2005, pp:284-295 [Conf]
  13. Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
    On the Complexity of 2-Monotone Restarting Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:237-248 [Conf]
  14. Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
    On Left-Monotone Deterministic Restarting Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:249-260 [Conf]
  15. Frantisek Mráz, Friedrich Otto, Martin Plátek
    On the Gap-Complexity of Simple RL-Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:83-94 [Conf]
  16. Gundula Niemann, Friedrich Otto
    Restarting automata, Church-Rosser languages, and representations of r.e. languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1999, pp:103-114 [Conf]
  17. Friedrich Otto
    Restarting Automata and Their Relations to the Chomsky Hierarchy. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:55-74 [Conf]
  18. Ronald V. Book, Friedrich Otto
    The Verifiability of Two-Party Protocols. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1985, pp:254-260 [Conf]
  19. Markus Holzer, Friedrich Otto
    Shrinking Multi-pushdown Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:305-316 [Conf]
  20. Friedrich Otto, Andrea Sattler-Klein
    FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:388-399 [Conf]
  21. Gundula Niemann, Friedrich Otto
    The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 1998, pp:243-257 [Conf]
  22. Klaus Madlener, Paliath Narendran, Friedrich Otto
    A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:279-290 [Conf]
  23. Paliath Narendran, Friedrich Otto
    The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:638-648 [Conf]
  24. Frantisek Mráz, Friedrich Otto, Martin Plátek
    Learning Analysis by Reduction from Positive Data. [Citation Graph (0, 0)][DBLP]
    ICGI, 2006, pp:125-136 [Conf]
  25. Masashi Katsura, Yuji Kobayashi, Friedrich Otto
    Undecidability Results for Monoids with Linear-Time Decidable Word Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:278-289 [Conf]
  26. Klaus Madlener, Friedrich Otto, Andrea Sattler-Klein
    Generating Small Convergent Systems Can Be Extremely Hard. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:299-308 [Conf]
  27. Robert Cremanns, Friedrich Otto
    Constructing Canonical Presentations for Subgroups of Context-Free Groups in Polynomial Time (extended abstract). [Citation Graph (0, 0)][DBLP]
    ISSAC, 1994, pp:147-153 [Conf]
  28. Norbert Kuhn, Klaus Madlener, Friedrich Otto
    A Test for lambda-Confluence for Certain Prefix Rewriting Systems with Applications to the Generalized Word Problem. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1990, pp:8-15 [Conf]
  29. Norbert Kuhn, Klaus Madlener, Friedrich Otto
    Computing Presentations for Subgroups of Context-Free Groups. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1992, pp:240-250 [Conf]
  30. Tomasz Jurdzinski, Friedrich Otto
    Shrinking Restarting Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:532-543 [Conf]
  31. Yuji Kobayashi, Friedrich Otto
    Repetitiveness of D0L-Languages Is Decidable in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:337-346 [Conf]
  32. Celia Wrathall, Volker Diekert, Friedrich Otto
    One-Rule Trace-Rewriting Systems and Confluence. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:511-521 [Conf]
  33. Klaus Madlener, Friedrich Otto
    Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:133-144 [Conf]
  34. Friedrich Otto
    Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:95-106 [Conf]
  35. Friedrich Otto
    Some Results about Confluence on a Given Congruence Class. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:145-155 [Conf]
  36. Friedrich Otto
    Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1989, pp:359-370 [Conf]
  37. Friedrich Otto
    On the Property of Preserving Regularity for String-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:83-97 [Conf]
  38. Friedrich Otto
    On the Connections between Rewriting and Formal Language Theory. [Citation Graph (0, 0)][DBLP]
    RTA, 1999, pp:332-355 [Conf]
  39. Friedrich Otto, Masashi Katsura, Yuji Kobayashi
    Cross-Sections for Finitely Presented Monoids with Decidable Word Problems. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:53-67 [Conf]
  40. Friedrich Otto, Paliath Narendran, Daniel J. Dougherty
    Some Independent Results for Equational Unification. [Citation Graph (0, 0)][DBLP]
    RTA, 1995, pp:367-381 [Conf]
  41. Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener
    Automatic Monoids Versus Monoids with Finite Convergent Presentations. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:32-46 [Conf]
  42. Craig C. Squier, Friedrich Otto
    Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:74-82 [Conf]
  43. Gerhard Buntrock, Friedrich Otto
    Growing Context-Sensitive Languages and Church-Rosser Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:313-324 [Conf]
  44. Klaus Madlener, Friedrich Otto
    Decidable Sentences for Context-Free Groups. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:160-171 [Conf]
  45. Tomasz Jurdzinski, Friedrich Otto
    Restricting the Use of Auxiliary Symbols for Restarting Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:176-187 [Conf]
  46. Hartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek
    Correctness Preservation and Complexity of Simple RL-Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:162-172 [Conf]
  47. Norbert Kuhn, Klaus Madlener, Friedrich Otto
    Computing Presentations for Subgroups of Polycyclic Groups and of Context-Free Groups. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1994, v:5, n:, pp:287-316 [Journal]
  48. Friedrich Otto
    Completing a Finite Special String-Rewriting System on the Congruence Class of the Empty Word. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1991, v:2, n:, pp:257-274 [Journal]
  49. G. Bauer, Friedrich Otto
    Finite Complete Rewriting Systems and the Complexity of the Word Problem. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1984, v:21, n:, pp:521-540 [Journal]
  50. Paliath Narendran, Friedrich Otto
    Elements of Finite Order for Finite Weight-Reducing and Confluent Thue Systems. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1988, v:25, n:5, pp:573-591 [Journal]
  51. Friedrich Otto
    On Deciding Whether a Monoid is a Free Monoid or is a Group. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1986, v:23, n:1, pp:99-110 [Journal]
  52. Friedrich Otto, Louxin Zhang
    Decision Problems for Finite Special String-Rewriting Systems that are Confluent on Some Congruence Class. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1991, v:28, n:5, pp:477- [Journal]
  53. Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek
    Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:64, n:1-4, pp:217-228 [Journal]
  54. Klaus Madlener, Friedrich Otto
    Some Undecidability Results for Finitely Generated Thue Congruences on aTwo-Letter Alphabet. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:30, n:1, pp:31-44 [Journal]
  55. Gerhard Buntrock, Friedrich Otto
    Growing Context-Sensitive Languages and Church-Rosser Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:141, n:1, pp:1-36 [Journal]
  56. Deepak Kapur, Paliath Narendran, Friedrich Otto
    On Ground-Confluence of Term Rewriting Systems [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:86, n:1, pp:14-31 [Journal]
  57. Paliath Narendran, Friedrich Otto, Karl Winklmann
    The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems is NP-Complete [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:63, n:1/2, pp:58-66 [Journal]
  58. Gundula Niemann, Friedrich Otto
    The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:197, n:1-2, pp:1-21 [Journal]
  59. Yuji Kobayashi, Friedrich Otto
    On Homotopical and Homological Finiteness Conditions for Finitely Presented Monoids. [Citation Graph (0, 0)][DBLP]
    IJAC, 2001, v:11, n:3, pp:391-403 [Journal]
  60. Yuji Kobayashi, Friedrich Otto
    Some Exact Sequences for The Homotopy (Bi-)Module af A Monoid. [Citation Graph (0, 0)][DBLP]
    IJAC, 2002, v:12, n:1-2, pp:247-283 [Journal]
  61. Friedrich Otto, Andrea Sattler-Klein
    The Property Fdt is Undecidable for Finitely Presented Monoids that Have Polynomial-Time Decidable Word Problems. [Citation Graph (0, 0)][DBLP]
    IJAC, 2000, v:10, n:3, pp:285-308 [Journal]
  62. Ronald V. Book, Friedrich Otto
    Cancellation Rules and Extended Word Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:1, pp:5-11 [Journal]
  63. Klaus Madlener, Friedrich Otto
    Using String-Rewriting for Solving the Word Problem for Finitely Presented Groups. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:281-284 [Journal]
  64. Paliath Narendran, Friedrich Otto
    Preperfectness is Undecidable for Thue Systems Containing Only Length-Reducing Rules and a Single Commutation Rule. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:29, n:3, pp:125-130 [Journal]
  65. Friedrich Otto
    Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:5, pp:237-242 [Journal]
  66. Klaus Madlener, Friedrich Otto
    Commutativity in Groups Presented By Finite Church-Rosser Thue Systems. [Citation Graph (0, 0)][DBLP]
    ITA, 1988, v:22, n:1, pp:93-111 [Journal]
  67. Robert McNaughton, Paliath Narendran, Friedrich Otto
    Church-Rosser Thue systems and formal languages. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:2, pp:324-344 [Journal]
  68. Friedrich Otto
    On Dehn Functions of Finitely Presented Bi-Automatic Monoids. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2000, v:5, n:4, pp:405-420 [Journal]
  69. Friedrich Otto, Nikola Ruskuc
    Confluent Monadic String-Rewriting Systems and Automatic Structures. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:3, pp:375-388 [Journal]
  70. Robert Cremanns, Friedrich Otto
    A Completion Procedure for Finitely Presented Groups That Is Based on Word Cycles. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2002, v:28, n:3, pp:235-256 [Journal]
  71. Paliath Narendran, Friedrich Otto
    Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1997, v:19, n:1, pp:87-115 [Journal]
  72. Friedrich Otto
    On Deciding the Confluence of a Finite String-Rewriting System on a Given Congruence Class. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1987, v:35, n:3, pp:285-310 [Journal]
  73. Friedrich Otto, Celia Wrathall
    Overlaps in Free Partially Commutative Monoids. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:42, n:2, pp:186-198 [Journal]
  74. Robert Cremanns, Friedrich Otto
    Finite Derivation Type Implies the Homological Finiteness Condition FP_3. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1994, v:18, n:2, pp:91-112 [Journal]
  75. Robert Cremanns, Friedrich Otto
    For Groups the Property of Having Finite Derivation Type is Equivalent to the Homological Finiteness Condition FP_3. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1996, v:22, n:2, pp:155-177 [Journal]
  76. Klaus Madlener, Friedrich Otto
    Pseudo-Natural Algorithms for the Word Problem for Finitely Presented Monoids and Groups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1985, v:1, n:4, pp:383-418 [Journal]
  77. Klaus Madlener, Friedrich Otto
    Pseudo-Natural Algorithms for Finitely Generated Presentations of Monoids and Groups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1988, v:5, n:3, pp:339-358 [Journal]
  78. Klaus Madlener, Andrea Sattler-Klein, Friedrich Otto
    On the Problem of Generating Small Convergent Systems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1993, v:16, n:2, pp:167-187 [Journal]
  79. Friedrich Otto
    When is an Extension of a Specification Consistent? Decidable and Undecidable Cases. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:3, pp:255-274 [Journal]
  80. Friedrich Otto, Masashi Katsura, Yuji Kobayashi
    Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented Monoids. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1998, v:26, n:5, pp:621-648 [Journal]
  81. Friedrich Otto, Olga Sokratova
    Reduction relations for monoid semirings. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2004, v:37, n:3, pp:343-376 [Journal]
  82. Friedrich Otto, Daniel E. Cohen, Klaus Madlener
    Separating the Intrinsic Complexity and the Derivational complexity of the Word Problem for Finitely Presented Groups. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1993, v:39, n:, pp:143-157 [Journal]
  83. Friedrich Otto
    Finite Canonical Rewriting Systems for Congruences Generated by Concurrency Relations. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1987, v:20, n:4, pp:253-260 [Journal]
  84. Friedrich Otto
    The Problem of Deciding Confluence on a Given Congruence Class is Tractable for Finite Special String-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1992, v:25, n:4, pp:241-251 [Journal]
  85. Friedrich Otto
    On Confluence Versus Strong Confluence for One-Rule Trace-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1995, v:28, n:4, pp:363-384 [Journal]
  86. Friedrich Otto, Celia Wrathall
    A Note on Thue Systems with a Single Defining Relation. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1985, v:18, n:2, pp:135-143 [Journal]
  87. Friedrich Otto
    Church-Rosser Thue Systems that Present Free Monoids. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:3, pp:786-792 [Journal]
  88. Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto
    McNaughton families of languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1581-1628 [Journal]
  89. Ronald V. Book, Friedrich Otto
    On the Security of Name-Stamp Protocols. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:319-325 [Journal]
  90. Ronald V. Book, Friedrich Otto
    On the Verifiability of Two-Party Algebraic Protocols. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:40, n:, pp:101-130 [Journal]
  91. Tomasz Jurdzinski, Friedrich Otto
    Restarting automata with restricted utilization of auxiliary symbols. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:2, pp:162-181 [Journal]
  92. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:301, pp:79-101 [Journal]
  93. Yuji Kobayashi, Friedrich Otto
    Repetitiveness of languages generated by morphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:240, n:2, pp:337-378 [Journal]
  94. Klaus Madlener, Paliath Narendran, Friedrich Otto, Louxin Zhang
    On Weakly Confluent Monadic String-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:113, n:1, pp:119-165 [Journal]
  95. Klaus Madlener, Friedrich Otto
    About the Descriptive Power of Certain Classes of Finite String-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:2&3, pp:143-172 [Journal]
  96. Etsuro Moriya, Dieter Hofbauer, Maria Huber, Friedrich Otto
    On state-alternating context-free grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:183-216 [Journal]
  97. Frantisek Mráz, Friedrich Otto, Martin Plátek, Tomasz Jurdzinski
    Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:366, n:3, pp:272-296 [Journal]
  98. Paliath Narendran, Friedrich Otto
    Complexity Results on the Conjugacy Problem for Monoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:227-243 [Journal]
  99. Paliath Narendran, Friedrich Otto
    The Problems of Cyclic Equality and Conjugacy for Finite Complete Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:27-38 [Journal]
  100. Paliath Narendran, Friedrich Otto
    Some Polynomial-Time Algorithms for Finite Monadic Church-Rosser Thue Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:68, n:3, pp:319-332 [Journal]
  101. Friedrich Otto
    Finite Complete Rewriting Systems for the Jantzen Monoid and the Greendlinger Group. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:32, n:, pp:249-260 [Journal]
  102. Friedrich Otto
    Some Undecidability Results for Non-Monadic Church-Rosser Thue Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:33, n:, pp:261-278 [Journal]
  103. Friedrich Otto
    The Undecidability of Self-Embedding for Finite Semi-Thue and Thue Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:225-232 [Journal]
  104. Friedrich Otto
    On Deciding Confluence of Finite String-Rewriting Systems Modulo Partial Commutativity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:1, pp:19-35 [Journal]
  105. Friedrich Otto
    Some Undecidability Results Concerning the Property of Preserving Regularity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:207, n:1, pp:43-72 [Journal]
  106. Friedrich Otto, Paliath Narendran
    Codes Modulo Finite Monadic String-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:1, pp:175-188 [Journal]
  107. Friedrich Otto, Paliath Narendran, Daniel J. Dougherty
    Equational Unification, Word Unification, and 2nd-Order Equational Unification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:198, n:1-2, pp:1-47 [Journal]
  108. Craig C. Squier, Friedrich Otto, Yuji Kobayashi
    A Finiteness Condition for Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:2, pp:271-294 [Journal]
  109. Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek
    Degrees of non-monotonicity for restarting automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:1-34 [Journal]
  110. Hartmut Messerschmidt, Friedrich Otto
    Strictly Deterministic CD-Systems of Restarting Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:424-434 [Conf]
  111. Frantisek Mráz, Friedrich Otto, Martin Plátek
    Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata. [Citation Graph (0, 0)][DBLP]
    MCU, 2007, pp:230-241 [Conf]
  112. Heiko Stamer, Friedrich Otto
    Restarting Tree Automata. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:510-521 [Conf]
  113. Frantisek Mráz, Martin Plátek, Friedrich Otto
    A Measure for the Degree of Nondeterminism of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:192-202 [Conf]
  114. Friedrich Otto
    An example of a one-relator group that is not a one-relation monoid. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:1, pp:101-103 [Journal]
  115. Paliath Narendran, Colm Ó'Dúnlaing, Friedrich Otto
    It is undecidable whether a finite special string-rewriting system presents a group. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:2, pp:153-159 [Journal]

  116. On Lexicalized Well-Behaved Restarting Automata That Are Monotone. [Citation Graph (, )][DBLP]


  117. On Stateless Deterministic Restarting Automata. [Citation Graph (, )][DBLP]


  118. CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions. [Citation Graph (, )][DBLP]


  119. Restarting Tree Automata and Linear Context-Free Tree Languages. [Citation Graph (, )][DBLP]


  120. Parallel Communicating Grammar Systems with Regular Control. [Citation Graph (, )][DBLP]


  121. Single-Path Restarting Tree Automata. [Citation Graph (, )][DBLP]


  122. A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata. [Citation Graph (, )][DBLP]


  123. On Alternating Phrase-Structure Grammars. [Citation Graph (, )][DBLP]


  124. On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata. [Citation Graph (, )][DBLP]


  125. CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages. [Citation Graph (, )][DBLP]


Search in 0.261secs, Finished in 0.270secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002