Publications

  • Articles in Journals or Books
  • Papers in Conference Proceedings
  • Technical Reports

    • Articles in Journals or Books:
  • 2011, 2010,
  • 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000
  • 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1991, 1990
  • 1989, 1988, 1987, 1986, 1985, 1984

    • Articles in 2011:

    Pardubská, D., Plátek, M. and Otto, F.:
    On the correspondence between parallel communicating grammar systems and restarting automata.
    In Bel-Enguix, G. and Jiménez-López, M.D., editors, Bio-Inspired Models for Natural and Formal Languages pages 153-188, Cambridge Scholar Publishing, Newcastle upon Tyne, 2011
    Messerschmidt, H. and Otto, F.:
    A hierarchy of monotone deterministic non-forgetting restarting automata.
    Theory of Computing Systems 2011, 48:343--373
    Pardubská, D., Plátek, M. and Otto, F.:
    Parallel communicating grammar systems with regular control and skeleton preserving FRR automata.
    Theoretical Computer Science 2011, 412:458--477

    Articles in 2010:

    Kutrib, M., Messerschmidt, H. and Otto, F.:
    On stateless deterministic restarting automata.
    Acta Informatica 2010, 47:391--412
    Kutrib, M., Messerschmidt, H. and Otto, F.:
    On stateless two-pushdown automata and restarting automata.
    Int. Journal of Foundations of Computer Science 2010, 21:781-798
    Moriya, E. and Otto, F.:
    On alternating phrase-structure grammars.
    Int. Journal of Foundations of Computer Science 2010, 21:1-25

    Articles in 2009:

    Plátek, M., Otto, F. and Mráz, F.:
    Two-dimensional hierarchies of proper languages of lexicalized FRR-automata.
    Information and Computation 2009, 207:1300-1314
    Mráz, F., Otto, F. and Plátek, M.:
    The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages.
    Theoretical Computer Science 2009, 410:3530-3538
    Otto, F.:
    Left-to-right regular languages and two-way restarting automata.
    RAIRO Informatique Théorique et Applications 2009, 43:653-665
    Messerschmidt, H. and Otto, F.:
    On deterministic CD-systems of restarting automata.
    Int. Journal of Foundations of Computer Science 2009, 20:185-209

    Articles in 2008:

    Kambites, M. and Otto, F.:
    Church-Rosser groups and growing context-sensitive groups
    Journal of Automata, Languages and Combinatorics 2008, 13:249-267
    Messerschmidt, H. and Otto, F.:
    On determinism versus nondeterminism for restarting automata.
    Information and Computation 2008, 206:1204-1218
    Jurdzinski, T., Otto, F., Mráz, F. and Plátek, M.:
    On the complexity of 2-monotone restarting automata.
    Theory of Computing Systems 2008, 42:488-518

    Articles in 2007:

    Otto, F.:
    Some decidability and undecidability results on Green's relations for automatic monoids.
    Semigroup Forum 2007, 75:520-535
    Messerschmidt, H. and Otto, F.:
    Cooperating distributed systems of restarting automata.
    Int. Journal of Foundations of Computer Science 2007, 18:1333-1342
    Jurdzinski, T. and Otto, F.:
    Sequential monotonicity for restarting automata.
    RAIRO Informatique Theorique et Applications 2007, 41:157--175
    Moriya, E. and Otto, F.:
    Two ways of introducing alternation into context-free grammars and pushdown automata.
    IEICE Trans. Inf. & Syst. 2007, E90-D:889--894
    Jurdzinski, T. and Otto, F.:
    Shrinking restarting automata.
    Int. Journal of Foundations of Computer Science 2007, 18:361--285

    Articles in 2006:

    Jurdzinski, T., Mráz, F., Otto, F. and Plátek, M.:
    Degrees of non-monotonicity for restarting automata.
    Theoretical Computer Science 2006, 369:1--34
    Mráz, F., Otto, F., Plátek, M. and Jurdzinski, T.:
    Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata.
    Theoretical Computer Science 2006, 366:272--296
    Jurdzinski, T. and Otto, F.:
    Restarting automata with restricted utilization of auxiliary symbols.
    Theoretical Computer Science 2006, 363:162--181
    Kambites, M. and Otto, F.:
    Uniform decision problems for automatic semigroups.
    Journal of Algebra 2006, 303:789--809
    Otto, F.:
    Restarting automata.
    In Esik, Z., Martin-Vide, C. and Mitrana, V., editors, Recent Advances in Formal Languages and Applications, pages 269--303, Studies in Computational Intelligence 25, Springer-Verlag, Berlin.

    Articles in 2005:

    Pride, S.J. and Otto, F.:
    On higher order homological finiteness of rewriting systems.
    Journal of Pure and Applied Algebra 2005, 200:149--161
    Moriya, E., Hofbauer, D., Huber, M. and Otto, F.:
    On State-Alternating Context-free Grammars.
    Theoretical Computer Science 2005, 337:183--216
    Mráz, F. and Otto, F.:
    Hierarchies of weakly monotone restarting automata.
    RAIRO Informatique Théorique et Applications 2005, 39:325--342
    Niemann, G. and Otto, F.:
    The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages.
    Information and Computation 2005, 197:1--21
    Jurdzinski, T., Otto, F., Mráz, F. and Plátek, M.:
    Deterministic two-way restarting automata and Marcus contextual grammars.
    Fundamenta Informaticae 2005, 64:217--228

    Articles in 2004:

    Jurdzinski, T., Lorys, K., Niemann, G. and Otto, F.:
    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, 9:407--437
    Otto, F. and Moriya, E.:
    Shrinking alternating two-pushdown automata.
    IEICE Trans. Inf. & Syst. 2004, E87-D:959-966
    Pride, Stephen J. and Otto, Friedrich:
    For Rewriting Systems the Topological Finiteness Conditions FDT and FHT are not Equivalent.
    The Journal of the London Mathematical Society 2004, 69:363--382
    Otto, F. and Sokratova, O.
    Reduction relations for monoid semirings
    Journal of Symbolic Computation 2004, 37:343-376

    Articles in 2003:

    Kobayashi, Y. and Otto, F.
    For finitely presented monoids the homological finiteness conditions FHT and bi-FP3 coincide
    Journal of Algebra 2003, 264:327-341
    Katsura, M., Kobayashi, Y. and Otto, F.
    Undecidable properties of monoids with word problem solvable in linear time - Part II. Cross-sections and homological and homotopical finiteness conditions
    Theoretical Computer Science 2003, 301:79-101
    Niemann, G. and Otto, F.
    The Church-Rosser languages and their relationship to other language classes
    In Martin-Vide, C. and Mitrana, V., editors, Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, and Back pages 295-303, Taylor and Francis, London.
    Beaudry, M., Holzer, M., Niemann, G. and Otto, F.
    McNaughton families of languages
    Theoretical Computer Science 2003, 290:1581-1628

    Articles in 2002:

    Otto, F.:
    Some results on Green's relations for monoids presented by monadic string-rewriting systems
    Semigroup Forum 2002, 65:374-385
    Cremanns, R. and Otto, F.:
    A completion procedure for finitely presented groups that is based on word cycles
    Journal of Automated Reasoning 2002, 28:235-256
    Kobayashi, Y. and Otto, F.:
    Some exact sequences for the homotopy (bi-)module of a monoid
    International Journal of Algebra and Computation 2002, 12:247-284

    Articles in 2001:

    Otto, F. and Ruskuc, N.:
    Confluent monadic string-rewriting systems and automatic structures
    Journal of Automata, Languages and Combinatorics 2001, 6:375-388
    Kobayashi, Y. and Otto, F.:
    On homotopical and homological finiteness conditions for finitely presented monoids.
    International Journal of Algebra and Computation 2001, 11:391-403

    Articles in 2000:

    Otto, F.:
    On Dehn functions of finitely presented bi-automatic monoids.
    Journal of Automata, Languages and Combinatorics, 2000, 5:405-419.
    Niemann, G. and Otto, F. :
    Confluent internal contextual languages
    In Martin-Vide, C. and Paun, G., editors, Recent Topics in Mathematical and Computational Linguistics, pages 234-244, The Publishing House of the Romanian Academy, Bucharest, 2000.
    Kobayashi, Y. and Otto, F. :
    Repetitiveness of languages generated by morphisms
    Theoretical Computer Science 2000, 240:337-378.
    Otto, F. and Sattler-Klein, A. :
    The property FDT is undecidable for finitely presented monoids that have polynomial-time decidable word problems
    International Journal of Algebra and Computation 2000, 10:285-307.

    Articles in 1998:

    Katsura, M., Kobayashi, Y., and Otto, F. :
    Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids
    Journal of Symbolic Computation, 1998, 26:621-648.
    Otto, F.:
    Some undecidability results concerning the property of preserving regularity
    Theoretical Computer Science,207:43--72.
    Otto, F.:
    Disjointness of congruences generated by finite monadic string-rewriting systems that are confluent is undecidable in general
    Bulletin of the EATCS,64:342--348.
    Otto, F. and Narendran, P. and Dougherty, D.:
    Equational unification, word unification, and 2nd-order equational unification
    Theoretical Computer Science,198:1-47.
    Buntrock, G. and Otto,F. :
    Growing Context-Sensitive Languages and Church-Rosser languages.
    Information and Computation, 141:1-36.

    Articles in 1997:

    Madlener, K. and Otto, F. :
    Some undecidability results for finitely generated Thue congruences on a two-letter alphabet.
    Fundamenta Informaticae, 30:31-44.
    Narendran, P. and Otto, F. :
    Single versus simultaneous equational unification and equational unification for variable-permuting theories.
    Journal of Automated Reasoning, 19:87-115.

    Articles in 1996:

    Cremanns, R. and Otto, F. :
    For groups the property of having finite derivation type is equivalent to the homological finiteness condition FP_3.
    Journal of Symbolic Computation , 22:155-177.

    Articles in 1995:

    Otto, F. :
    On confluence versus strong confluence for one-rule trace-rewriting systems.
    Mathematical Systems Theory, 28:363-384.
    Otto, F. :
    Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general.
    Information Processing Letters, 53:237-242.

    Articles in 1994:

    Cremanns, R. and Otto, F. :
    Finite derivation type implies the homological finiteness condition FP_3.
    Journal of Symbolic Computation, 18:91-112.
    Kuhn, N., Madlener, K., and Otto, F. :
    Computing presentations for subgroups of polycyclic groups and of context-free groups.
    Applicable Algebra in Engineering, Communication and Computing, 5:287-316.
    Madlener, K. and Otto, F. :
    Some undecidability results for finitely generated Thue congruences on a two-letter alphabet.
    In Schock, E., editor, Beiträge zur Angewandten Analysis und Informatik, Helmut Brakhage zu Ehren, pages 248-261, Aachen. Verlag Shaker.
    Otto, F. and Narendran, P. :
    Codes modulo finite monadic string-rewriting systems.
    Theoretical Computer Science, 134:175-188.
    Squier, C., Otto, F., and Kobayashi, Y. :
    A finiteness condition for rewriting systems.
    Theoretical Computer Science, 131:271-294.

    Articles in 1993:

    Book, R. and Otto, F. :
    String-Rewriting Systems.
    Springer-Verlag, New York.
    Cohen, D., Madlener, K., and Otto, F. :
    Separating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups.
    Mathematical Logic Quaterly, 39:143-157.
    Madlener, K., Narendran, P., Otto, F., and Zhang, L. :
    On weakly confluent monadic string-rewriting systems.
    Theoretical Computer Science, 113:119-165.
    Madlener, K., Sattler-Klein, A., and Otto, F. :
    On the problem of generating small convergent systems.
    Journal of Symbolic Computation, 16:167-187.

    Articles in 1992:

    Otto, F. :
    Completing a finite special string-rewriting system on the congruence class of the empty word.
    Applicable Algebra in Engineering, Communication and Computing, 2:257-274.
    Otto, F. :
    The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems.
    Mathematical Systems Theory, 25:241-251.

    Articles in 1991:

    Narendran, P., O'Dúnlaing, C., and Otto, F. :
    It is undecidable whether a finite special string-rewriting system presents a group.
    Discrete Mathematics, 98:153-159.
    Otto, F. :
    When is an extension of a specification consistent? Decidable and undecidable cases.
    Journal of Symbolic Computation, 12:255-273.
    Otto, F. and Wrathall, C. :
    Overlaps in free partially commutative monoids.
    Journal Computer System Sciences, 42:186-198.
    Otto, F. and Zhang, L. :
    Decision problems for finite special string-rewriting systems that are confluent on some congruence class.
    Acta Informatica, 28:477-510.

    Articles in 1990:

    Kapur, D., Narendran, P., and Otto, F. :
    On ground-confluence of term rewriting systems.
    Information and Computation, 86:14-31.

    Articles in 1989:

    Madlener, K. and Otto, F. :
    About the descriptive power of certain classes of finite string-rewriting systems.
    Theoretical Computer Science, 67:143-172.
    Narendran, P. and Otto, F. :
    Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems.
    Theoretical Computer Science, 68:319-332.
    Otto, F. :
    On deciding confluence of finite string-rewriting systems modulo partial commutativity.
    Theoretical Computer Science, 67:19-35.

    Articles in 1988:

    Madlener, K. and Otto, F. :
    Commutativity in groups presented by finite Church-Rosser Thue systems.
    RAIRO Informatique Théorique et Applications, 22:93-111.
    Madlener, K. and Otto, F. :
    Pseudo-natural algorithms for finitely generated presentations of monoids and groups.
    Journal of Symbolic Computation, 5:339-358.
    McNaughton, R., Narendran, P., and Otto, F. :
    Church-Rosser Thue systems and formal languages.
    Journal Association Computing Machinery, 35:324-344.
    Narendran, P. and Otto, F. :
    Elements of finite order for finite weight-reducing and confluent Thue systems.
    Acta Informatica, 25:573-591.
    Narendran, P. and Otto, F. :
    Preperfectness is undecidable for Thue systems containing only length-reducing rules and a single commutation rule.
    Information Processing Letters, 29:125-130.
    Otto, F. :
    An example of a one-relator group that is not a one-relation monoid.
    Discrete Mathematics, 69:101-103.

    Articles in 1987:

    Madlener, K. and Otto, F. :
    Using string-rewriting for solving the word problem for finitely presented groups.
    Information Processing Letters, 24:281-284.
    Otto, F. :
    On deciding the confluence of a finite string-rewriting system on a given congruence class.
    Journal Computer System Sciences, 35:285-310.
    Otto, F. :
    Finite canonical rewriting systems for congruences generated by concurrency relations.
    Mathematical Systems Theory, 20:253-260.
    Otto, F. :
    Deciding algebraic properties of finitely presented monoids.
    In Benninghofen, B., Kemmerich, S., and Richter, M., editors, Systems of Reductions, Lecture Notes in Computer Science 277, pages 218-255. Springer-Verlag, Berlin.

    Articles in 1986:

    Avenhaus, J., Madlener, K., and Otto, F. :
    Groups presented by finite two-monadic Church-Rosser Thue systems.
    Transactions American Mathematical Society, 297:427-443.
    Narendran, P. and Otto, F. :
    The problems of cyclic equality and conjugacy for finite complete rewriting systems.
    Theoretical Computer Science, 47:27-38.
    Otto, F. :
    On deciding whether a monoid is a free monoid or is a group.
    Acta Informatica, 23:99-110.
    Otto, F. :
    On two problems related to cancellativity.
    Semigroup Forum, 33:331-356.
    Otto, F. :
    Church-Rosser Thue systems that present free monoids.
    SIAM Journal on Computing, 15:786-792.
    Otto, F. :
    The undecidability of self-embedding for finite semi-Thue and Thue systems.
    Theoretical Computer Science, 47:225-232.

    Articles in 1985:

    Book, R. and Otto, F. :
    Cancellation rules and extended word problems.
    Information Processing Letters, 20:5-11.
    Book, R. and Otto, F. :
    On the security of name-stamp protocols.
    Theoretical Computer Science, 39:319-325.
    Book, R. and Otto, F. :
    On the verifiability of two-party algebraic protocols.
    Theoretical Computer Science, 40:101-130.
    Madlener, K. and Otto, F. :
    Pseudo-natural algorithms for the word problem for finitely presented monoids and groups.
    Journal of Symbolic Computation, 1:383-418.
    Madlener, K. and Otto, F. :
    Derivation-bounded groups.
    Revista Colombiana de Mathematicas, 19:131-161.
    Narendran, P. and Otto, F. :
    Complexity results on the conjugacy problem for monoids.
    Theoretical Computer Science, 35:227-243.
    Otto, F. :
    Classes of regular and context-free languages over countably infinite alphabets.
    Discrete Applied Mathematics, 12:41-56.
    Otto, F. :
    Elements of finite order for finite monadic Church-Rosser Thue systems.
    Transactions American Mathematical Society, 291:629-637.
    Otto, F. and Wrathall, C. :
    A note on Thue systems with a single defining relation.
    Mathematical Systems Theory, 18:135-143.

    Articles in 1984:

    Bauer, G. and Otto, F. :
    Finite complete rewriting systems and the complexity of the word problem.
    Acta Informatica, 21:521-540.
    Narendran, P., Otto, F., and Winklmann, K. :
    The uniform conjugacy problem for finite Church-Rosser Thue systems is NP-complete.
    Information Control, 63:58-66.
    Otto, F. :
    Conjugacy in monoids with a special Church-Rosser presentation is decidable.
    Semigroup Forum, 29:223-240.
    Otto, F. :
    Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group.
    Theoretical Computer Science, 32:249-260.
    Otto, F. :
    Some undecidability results for non-monadic Church-Rosser Thue systems.
    Theoretical Computer Science, 33:261-278.

    Papers in Conference Proceedings:
  • 2011, 2010,
  • 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000
  • 1999, 1998, 1997, 1996, 1995, 1994, 1992, 1991, 1990
  • 1989, 1988, 1987, 1986, 1985

    • 2011:

    Nagy, B. and Otto, F.:
    Globally deterministic CD-systems of stateless R(1)-automata.
    In Dediu, A.H., Inenaga, S. and Martin-Vide, C. , editors, Language and Automata Theory and Applications, LATA 2011, Proc., Lecture Notes in Computer Science 6638, pages 390--401, Springer, Berlin, 2011.
    Hundeshagen, N., Otto, F. and Vollweiler, M.:
    Transductions computed by PC-systems of monotone deterministic restarting automata.
    In Domaratzki, M. and Salomaa, K., editors, CIAA 2010: Implementation and Application of Automata, Proc., Lecture Notes in Computer Science 6482, pages 163-172, Springer, Berlin, 2011.
    Nagy, B. and Otto, F.:
    Finite-state acceptors with translucent letters.
    In Bel-Enguix, G., Dahl, V. and De La Puente, A.O. , editors, BILC 2011: AI Methods for Interdisciplinary Research in Language and Biology, Proc., pages 3-13, SciTePress, Protugal, 2011.
    Nagy, B. and Otto, F.:
    An automata-theoretical characterization of context-free trace languages.
    In Cerná, I, Gyimóthy, T., Hromkovic, J., Jefferey, K., Královic, R., Vukolic, M. and Wolf, S., editors, SOFSEM 2011: Theory and Practice of Computer Science, Proc., Lecture Notes in Computer Science 6543, pages 406-417, Springer, Berlin, 2011.

    2010:

    Otto, F.:
    On proper languages and transformations of lexicalized types of automata.
    In Ito, M., Kobayashi, Y. and Shoji, K., editors, Automata, Formal Languages and Algebraic Systems, AFLAS 2008, Proc., pages 201--222, World Scientific, Singapore, 2010.
    Leupold, P. and Otto, F.:
    On McNaughton families of languages specified by certain variants of monadic string-rewriting systems.
    In Bordihn, H., Freund, R., Hinze, T., Holzer, M., Kutrib, M. and Otto, F., editors, Second Workshop on Non-Classical Models for Automata and Applications, NCMA 2010, Proc., books\@ocg.at, Band 263, pages 112--126, Oesterreichische Computer Gesellschaft, Wien, 2010.
    Otto, F., Plátek, M. and Mráz, F.:
    On lexicalized well-behaved restarting automata that are monotone.
    In Gao, Y., Lu, H., Seki, Sh. and Yu, Sh., editors, Developments in Language Theory, DLT 2010, Proc., Lecture Notes in Computer Science 6224, pages 352--363, Springer, Berlin, 2010.
    Nagy, B. and Otto, F.:
    CD-systems of stateless deterministic R(1)-automata accept all rational trace languages.
    In Dediu, A.H., Fernau, H. and Martin-Vide, C., editors, Language and Automata Theory and Applications, LATA 2010, Proc., Lecture Notes in Computer Science 6031, pages 463--474, Springer, Berlin, 2010.
    Otto, F.:
    CD-systems of restarting automata governed by explicit enable and disable conditions.
    In van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J. and Rumpe, B., editors, SOFSEM 2010: Theory and Practice of Computer Science, Proc., Lecture Notes in Computer Science 5901, pages 627-638, Springer, Berlin, 2010.

    2009:

    Pardubská, D., Plátek, M. and Otto, F.:
    Parallel communicating grammars systems with regular control.
    In Bozapalidis, S. and Rahonis, G., editors, Algebraic Informatics, CAI 2009, Proc., Lecture Notes in Computer Science 5725, pages 342-360, Springer, Berlin, 2009.
    Otto, F. and Stamer, H.:
    Single-path restarting tree automata.
    In Bozapalidis, S. and Rahonis, G., editors, Algebraic Informatics, CAI 2009, Proc., Lecture Notes in Computer Science 5725, pages 324-341, Springer, Berlin, 2009.
    Pardubská, D., Plátek, M. and Otto, F.:
    On parallel communicating grammars systems and correctness preserving restarting automata.
    In Dediu, A.H., Ionescu, A.M. and Martin-Vide, C., editors, Language and Automata Theory and Applications, LATA 2009, Proc., Lecture Notes in Computer Science 5457, pages 660-671, Springer, Berlin, 2009.
    Kutrib, M., Messerschmidt, H. and Otto, F.:
    On stateless deterministic restarting automata.
    In Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P. and Valencia, F., editors, SOFSEM 2009: Theory and Practice of Computer Science, Proc., Lecture Notes in Computer Science 5404, pages 353-364, Springer, Berlin, 2009.

    2008:

    Pardubská, D., Plátek, M. and Otto, F.:
    On PCGS and FRR-automata.
    In Vojtás, P., editor, Information Technologies - Applications and Theory, ITAT 2008, Proc., pages 41-47, Department of Computer Science, Faculty of Science, Pavol Jozef Safárik University, Kosice, 2008.
    Kutrib, M., Messerschmidt, H. and Otto, F.:
    On stateless two-pushdown automata and restarting automata.
    In Csuhaj-Varjú, E. and Ésik, Z., editors, Automata and Formal Languages, AFL 2008, Proc., pages 257-268, Computer and Automation Research Institute, Hungarian Academy of Sciences, 2008.
    Otto, F. and Plátek, M.:
    A two-dimensional taxonomy of proper languages of lexicalized FRR-automata.
    In Martin-Vide, C., Otto, F. and Fernau, H., editors, Language and Automata Theory and Applications, LATA 2008, Proc., Lecture Notes in Computer Science 5196, pages 409-420, Springer, Berlin, 2008.
    Otto, F. and Moriya, E.:
    On alternating phrase-structure grammars.
    In: Martin-Vide, C., Otto, F. and Fernau, H. (eds.), Language and Automata Theory and Applications, LATA 2008, Proc., Lecture Notes in Computer Science 5196, pages 397-408, Springer, Berlin, 2008.
    Martin-Vide, C., Otto, F. and Fernau, H.:
    Language and Automata Theory and Applications, LATA 2008, Proc.,
    Lecture Notes in Computer Science 5196, Springer, Berlin, 2008.

    2007:

    Mráz, F., Otto, F. and Plátek, M.:
    Free word-order and restarting automata.
    In Loos, R., Fazekas, S.Z. and Martin-Vide, C., editors, LATA 2007, Preproceedings, Report 35/07, pages 425-436, Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, 2007.
    Messerschmidt, H. and Otto, F.:
    On determinism versus nondeterminism for restarting automata.
    In Loos, R., Fazekas, S.Z. and Martin-Vide, C., editors, LATA 2007, Preproceedings, Report 35/07, pages 413-424, Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, 2007.
    Stamer, H. and Otto, F.:
    Restarting tree automata and linear context-free tree languages.
    In Bozapalidis, S. and Rahonis, G., editors, Algebraic Informatics, CAI 2007, Proc., Lecture Notes in Computer Science 4728, pages 275-289, Springer, Berlin, 2007.
    Mráz, F., Plátek, M. and Otto, F.:
    A measure for the degree of nondeterminism of context-free languages.
    In Holub, J. and Zd'árek, J., editors, CIAA 2007, Proceedings, Lecture Notes in Computer Science 4783, pages 192-202, Springer, Berlin, 2007.
    Mráz, F., Otto, F. and Plátek, M.:
    Hierarchical relaxations of the correctness preserving property for restarting automata.
    In Durand-Lose, J. and Margenstern, M., editors, MCU 2007, Proc., Lecture Notes in Computer Science 4664, pages 230-241, Springer, Berlin, 2007.
    Messerschmidt, H. and Otto, F.:
    Strictly deterministic CD-systems of restarting automata.
    In Csuhaj-Varjú, E. and Ésik, Z., editors, Fundamentals of Computation Theory, FCT 2007, Proc., pages 424--434, Lecture Notes in Computer Science 4639, Springer, Berlin.
    Otto, F.:
    Relative monoid presentations and finite derivation type.
    In André, J.M., Fernandes, V.H., Branco, M.J.J., Gomes, G.M.S., Fountain, J. and Meakin, J.C., editors, Semigroups and Formal Languages, Proc. of the International Conference in Honour of the 65th Birthday of Donald B. McAlister, pages 240--254, World Scientific, Singapore.
    Stamer, H. and Otto F.:
    Restarting tree automata.
    In van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H. and Plásil, F., editors, SOFSEM 2007: Theory and Practise of Computer Science, Proc., pages 510--521, Lecture Notes in Computer Science 4362, Springer, Berlin.

    2006:

    Mráz, F., Otto, F. and Plátek, M.:
    Learning analysis by reduction from positive data
    In Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T. and Tomita, E., editors, Proceedings ICGI 2006, pages 125--136, Lecture Notes in Articial Intelligence 4201, Springer-Verlag, Berlin.
    Messerschmidt, H., Mráz, F., Otto, F. and Plátek, M.:
    Correctness preservation and complexity of simple RL-automata
    In Ibarra, O. and Yen, H.-C., editors, Proceedings CIAA 2006, pages 162--172, Lecture Notes in Computer Science 4094, Springer-Verlag, Berlin.
    Mráz, F., Otto, F. and Plátek, M.:
    On the gap-complexity of simple RL-automata
    In Ibarra, O. and Dang, Z., editors, Developments in Language Theory, Proceedings DLT 2006, pages 83--94, Lecture Notes in Computer Science 4036, Springer-Verlag, Berlin.
    Messerschmidt, H. and Otto. F.:
    On nonforgetting restarting automata that are deterministic and/or monotone
    In Grigoriev, D., Harrison, J. and Hirsch, E.A., editors, Conference on International Computer Science Symposium in Russia, Proceedings CRS 2006, pages 247--258, Lecture Notes in Computer Science 3967, Springer-Verlag, Berlin.
    Jurdzinski, T. and Otto, F.:
    Restricting the use of auxiliary symbols for restarting automata.
    In Farré, J., Litovsky, I. and Schmitz, S., editors, Tenth International Conference on Implementation and Application of Automata, Proceedings CIAA 2005, pages 176--187, Lecture Notes in Computer Science 3845, Springer-Verlag, Berlin.

    2005:

    Jurdzinski, T., Otto. F., Mráz, F. and Plátek, M.:
    Cut hierarchies for restarting automata and Marcus t-contextual grammars.
    In Bozapalidis, S., Kalampakas, A. and Rahonis, G., editors, Conference on Algebraic Informatics, Proceedings CAI 2005, pages 157--171, Aristotle University, Thessaloniki.
    Holzer, M. and Otto, F.:
    Shrinking multi-pushdown automata.
    In Liskiewicz, M. and Reischuk, R., editors, Fundamentals of Computation Theory, Proceedings FCT 2005, pages 305--316, Lecture Notes in Computer Science 3623, Springer-Verlag, Berlin.
    Jurdzinski, T. and Otto, F.:
    Shrinking restarting automata.
    In Jedrzejowicz, J. and Szepietowski, A., editors, Mathematical Foundations of Computer Science, Proceedings MFCS 2005, pages 532--543, Lecture Notes in Computer Science 3618, Springer-Verlag, Berlin.
    Jurdzinski, T. and Otto, F.:
    Sequential monotonicity for restarting automata.
    In Vojtás, P., editor, ITAT 2004, Information Technologies - Applications and Theory, Proceedings, pages 39--48, Department of Computer Science, Faculty of Science, Pavol Jozef Safárik University, Kosice.
    Jurdzinski, T., Mráz, F., Otto, F. and Plátek, M.:
    Monotone deterministic RL-automata don't need auxiliary symbols.
    In De Felice, C. and Restivo, A., editors, Developments in Language Theory, Proceedings DLT 2005, pages 284--295, Lecture Notes in Computer Science 3572, Springer-Verlag, Berlin.
    Otto, F., Mráz, F. and Plátek, M.:
    Degrees of monotonicity and Marcus t-contextual grammars.
    In Ésik, Z. and Fülöp, Z., editors, Automata and Formal Languages, Proceedings AFL 2005, pages 249--262, Institute of Informatics, University of Szeged

    2004:

    Jurdzinski, T., Otto, F., Mráz, F. and Plátek, M.:
    On left-monotone deterministic restarting automata.
    In Calude, C.S., Calude, E. and Dinneen, M.J., editors, Developments in Language Theory, Proceedings DLT 2004, pages 249-260, Lecture Notes in Computer Science 3340, Springer-Verlag, Berlin.
    Jurdzinski, T., Otto, F., Mráz, F. and Plátek, M.:
    On the complexity of 2-monotone restarting automata.
    In Calude, C.S., Calude, E. and Dinneen, M.J., editors, Developments in Language Theory, Proceedings DLT 2004, pages 237-248, Lecture Notes in Computer Science 3340, Springer-Verlag, Berlin.
    Mráz, F., Otto, F. and Plátek, M.:
    Restarting automata and combinations of constraints.
    In Voitás, P., editor, ITAT 2003, Information Technologies - Applications and Theory, Proc., pages 83-91, Department of Computer Science, Faculty of Science, Pavol Jozef Safárik University, Kosice.

    2003:

    Plátek, M., Otto, F. and Mráz, F.:
    Restarting automata and variants of j-monotonicity.
    In Csuhaj-Varjú, E., Kintala, C. and Wotschke, D., editors, Descriptional Complexity of Formal Systems, Proceedings DCFS 2003, pages 303-312, MTA SZTAKI, Budapest.
    Niemann, G., Otto, F.:
    Further results on restarting automata.
    In Ito, M. and Imaoka, T., editors, Words, Languages and Combinatorics III, Proc., pages 352-369, World Scientific, Singapore.
    Otto, F.:
    Restarting automata and their relations to the Chomsky hierarchy.
    In Esik, Z. and Fülöp, Z., editors, Developments in Language Theory, Proceedings DLT 2003 , pages 55-74, Lecture Notes in Computer Science 2710, Springer-Verlag, Berlin.
    Hoffmann, M., Kuske, D., Otto, F., Thomas, R.:
    Some relatives of automatic and hyperbolic groups.
    In Gomes, G.M.S., Pin, J.E. and Silva, P.V., editors, Semigroups, Algorithms, Automata and Languages, pages 379-406, World Scientific, Singapore.

    2002:

    Hofbauer, D., Kögl, C., Madlener, K., Otto, F.:
    XSSR: An experimental system for string rewriting - decision problems, algorithms, and implementation.
    In Cohen, A.M., Gao, X.S. and Takayama, N., editors, Proceedings of the 1st International Congress of Mathematical Software, ICMS-02, Beijing, China, pages 126-135, World Scientific, Singapore.
    Beaudry, M., Holzer, M., Niemann, G., Otto, F.:
    On the relationship between the McNaughton families of languages and the Chomsky hierarchy.
    In Kuich, W., Rozenberg, G. and Salomaa, A., editors, Developments in Language Theory, Proceedings DLT 2001, pages 340-348, Lecture Notes in Computer Science 2295, Springer-Verlag, Berlin.

    2001:

    Niemann, G., Otto, F.:
    On the power of RRWW-automata.
    In Ito, M., Paun, G. and Yu, S., editors, Words, Semigroups, and Transductions. Essays in Honour of Gabriel Thierrin, On the Occasion of His 80th Birthday, pages 341-355, World Scientific, Singapore.

    2000:

    Katsura, M., Kobayashi, Y., Otto, F.:
    Undecidability results for monoids with linear-time decidable word problem.
    In Lee, D.T. and Teng, Sh., editors, Algorithms and Computation, Proceedings ISAAC 2000, pages 278-289, Lecture Notes in Computer Science 1969, Springer-Verlag, Berlin.
    Niemann, G. and Otto, F.:
    Restarting automata, Church-Rosser languages, and representations of r.e. languages.
    In Rozenberg, G. and Thomas, W., editors, Developments in Languages Theory - Foundations, Applications, and Perspectives, Proceedings DLT 1999, pages 103-114, World Scientific, Singapore.
    Madlener, K. and Otto, F. :
    Some applications of prefix-rewriting in monoids, groups and rings.
    In Atkinson, M. and Gilbert, N. and Howie, J. and Linton, S. and Robertson, E., editors, Computational and Geometric Aspects of Modern Algebra, pages 150-191, London Mathematical Society Lecture Notes 275, Cambridge University Press, Cambridge.
    Otto, F. :
    A survey on the computational power of some classes of finite monoid presentations.
    In Birget, J.C. and Margolis, S. and Meakin, J. and Sapir, M., editors, Algorithmic Problems in Groups and Semigroups, pages 171-194, Trends in Mathematics, Birkhäuser, Boston.

    1999:

    Niemann, G. and Otto, F.:
    Restarting automata, Church-Rosser languages, and representations of r.e. languages.
    In Thomas, W., editor, DLT 99, Preproceedings, pages 49-62, Aachener Informatik-Berichte 99-5, RWTH Aachen.
    Otto, F.:
    On s-regular prefix-rewriting systems and automatic structures.
    In Asano, T. and Imai, H. and Lee, D.T. and Nakano, S. and Tokuyama, T., editors, Computing and Combinatorics, Proceedings COCOON'99, pages 422-431, Lecture Notes in Computer Science 1627, Springer-Verlag, Berlin.
    Otto, F.:
    Modular properties of monoids and string-rewriting systems.
    In Nehaniv, Ch. and Ito, M., editors, Algebraic Engineering, Proceedings, pages 538-554. World Scientific, Singapore.
    Otto, F.:
    On the connections between rewriting and formal language theory.
    In Narendran, P. and Rusinowitch, M., editors, Rewriting Techniques and Applications, Proceedings RTA'99, pages 332-355, Lecture Notes in Computer Science 1631, Springer-Verlag, Berlin.

    1998:

    Otto, F.:
    Uniform decision problems for certain restricted classes of finite monoid presentations - a survey on recent undecidability results.
    In Howie, J.M. and Ruskuc, N., editors, Semigroups and Applications, Proceedings, pages 152-170. World Scientific, Singapore.
    Niemann, G. and Otto, F.:
    The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages.
    In Nivat, M., editor, Foundations of Software Science and Computation Structures, Proceedings FoSSaCS'98, Lecture Notes in Computer Science 1378, pages 243-257. Springer-Verlag, Berlin.
    Otto, F. and Sattler-Klein, A. and Madlener, K.:
    Automatic monoids versus monoids with finite convergent presentations.
    In Nipkow, T., editor, Rewriting Techniques and Applications, Proceedings RTA'98, Lecture Notes in Computer Science 1379, pages 32-46. Springer-Verlag, Berlin.

    1997:

    Kobayashi, Y. and Otto, F. :
    Properties of monoids that are presented by finite convergent string-rewriting systems - a survey.
    In Du, D. and Ko, K., editors, Advances in Algorithms, Languages and Complexity, pages 226-266, Dordrecht. Kluwer Academic Publ.
    Kobayashi, Y. and Otto, F. :
    Repetitiveness of D0L-languages is decidable in polynomial time.
    In Prívara, I. and Ruzicka, P., editors, Mathematical Foundations of Computer Science 1997, Proceedings MFCS'97, Lecture Notes in Computer Science 1295, pages 337-346. Springer-Verlag, Berlin.
    Kobayashi, Y., Otto, F., and Séébold, P. :
    A complete characterization of repetitive morphisms over the two-letter alphabet.
    In Jiang, T. and Lee, D., editors, Computing and Combinatorics, Proceedings COCOON'97, Lecture Notes in Computer Science 1276, pages 393-402. Springer-Verlag, Berlin.
    Narendran, P. and Otto, F. :
    The word matching problem is undecidable for finite special string-rewriting systems that are confluent.
    In Degano, P.and~Gorrieri, R. and Marchetti-Spaccamela, A., editors, Automata, Languages and Programming, Lecture Notes in Computer Science 1256, pages 638-648. Springer-Verlag, Berlin.
    Otto, F. :
    On the property of preserving regularity for string-rewriting systems.
    In Comon, H., editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science 1232, pages 83-97. Springer-Verlag, Berlin.
    Otto, F., Katsura, M., and Kobayashi, Y. :
    Cross-sections for finitely presented monoids with decidable word problems.
    In Comon, H., editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science 1232, pages 53-67. Springer-Verlag, Berlin.
    Otto, F. and Sattler-Klein, A. :
    FDT is undecidable for finitely presented monoids with solvable word problems.
    In Chlebus, B. and Czaja, L., editors, Fundamentals of Computation Theory, Proceedings FCT'97 , Lecture Notes in Computer Science 1279, pages 388-399. Springer-Verlag, Berlin.

    1996:

    Otto, F. :
    Some decision problems related to the regularity of monoids.
    In Almeida, J., Gomes, G., and Silva, P., editors, Semigroups, Automata and Languages, pages 211-224, World Scientific, Singapure.

    1995:

    Buntrock, G. and Otto, F. :
    Growing context-sensitive languages and Church-Rosser languages.
    In Mayr, E. and Puech, C., editors, Proc. of STACS 95, Lecture Notes in Computer Science 900, pages 313-324. Springer-Verlag, Berlin.
    Otto, F., Narendran, P., and Dougherty, D. :
    Some independence results for equational unification.
    In Hsiang, J., editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science 914, pages 367-381. Springer-Verlag, Berlin.

    1994:

    Cremanns, R. and Otto, F. :
    Constructing canonical presentations for subgroups of context-free groups in polynomial time.
    In von zur Gathen, J. and Giesbrecht, M., editors, Proceedings ISSAC'94, pages 147-153, ACM, New York.
    Otto, F. :
    A survey on specialized completion procedures for constructing e-confluent string-rewriting systems.
    In Ito, M. and Jürgensen, H., editors, Words, Languages and Combinatorics II, Proc., pages 301-316, World Scientific, Singapore.

    1992:

    Kuhn, N., Madlener, K., and Otto, F. :
    Computing presentations for subgroups of polycyclic groups and of context-free groups.
    In Wang, P., editor, Proceedings ISSAC'92, pages 240-250, ACM, New York.
    Madlener, K., Otto, F., and Sattler-Klein, A. :
    Generating small convergent systems can be extremely hard.
    In Ibaraki, T., Inagaki, Y., Iwama, K., Nishizeki, T., and Yamashita, M., editors, Proceedings ISAAC'92, Lecture Notes in Computer Science 650, pages 299-308. Springer-Verlag, Berlin.
    Otto, F. :
    Some recent results on string-rewriting systems that are confluent on some congruence class - a survey.
    In Ito, M., editor, Words, Languages and Combinatorics, Proc., pages 385-409, World Scientific, Singapore.
    Wrathall, C., Diekert, V., and Otto, F. :
    One-rule trace-rewriting systems and confluence.
    In Havel, I. and Koubek, V., editors, Mathematical Foundations of Computer Science 1992, Lecture Notes in Computer Science 629, pages 511-521. Springer-Verlag, Berlin.

    1991:

    Madlener, K., Narendran, P., and Otto, F. :
    A specialized completion procedure for monadic string-rewriting systems presenting groups.
    In Albert, J., Monien, B., and Artalejo, M., editors, Proceedings 18th ICALP, Lecture Notes in Computer Science 510, pages 279-290. Springer-Verlag, Berlin.
    Madlener, K. and Otto, F. :
    Decidable sentences for context-free groups.
    In Choffrut, C. and Jantzen, M., editors, Proceedings STACS'91, Lecture Notes in Computer Science 480, pages 160-171. Springer-Verlag, Berlin.
    Otto, F. :
    Some undecidability results for weakly confluent monadic string-rewriting systems.
    In Mattson, H., Mora, T., and Rao, T., editors, Proceedings AAECC-9, Lecture Notes in Computer Science 539, pages 292-303. Springer-Verlag, Berlin.

    1990:

    Kuhn, N., Madlener, K., and Otto, F. :
    A test for \lambda-confluence for certain prefix rewriting systems with applications to the generalized word problem.
    In Watanabe, S. and Nagata, M., editors, Proceedings ISSAC'90, pages 8-15, New York. ACM.
    Narendran, P. and Otto, F. :
    Some results on equational unification.
    In Stickel, M., editor, Proceedings 10th CADE, Lecture Notes in Artificial Intelligence 449, pages 276-291. Springer-Verlag, Berlin.

    1989:

    Narendran, P. and Otto, F. :
    It is decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent Thue system is torsion-free.
    In Huguet, L. and Poli, P., editors, Proceedings AAECC-5, Lecture Notes in Computer Science 356, pages 341-349. Springer-Verlag, Berlin.
    Otto, F. :
    Restrictions of congruencess generated by finite canonical string-rewriting systems.
    In Dershowitz, N., editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science 355, pages 359-370. Springer-Verlag, Berlin.

    1988:

    Madlener, K. and Otto, F. :
    On groups having finite monadic Church-Rosser presentations.
    In Jürgensen, H., Lallement, G., and Weinert, H., editors, Semigroups, Theory and Applications, Lecture Notes in Mathematics 1320, pages 218-234. Springer-Verlag, Berlin.

    1987:

    Madlener, K. and Otto, F. :
    Groups presented by certain classes of finite length-reducing string-rewriting systems.
    In Lescanne, P., editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science 256, pages 133-144. Springer-Verlag, Berlin.
    Otto, F. :
    Some results about confluence on a given congruence class.
    In Lescanne, P., editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science 256, pages 145-155. Springer-Verlag, Berlin.
    Squier, C. and Otto, F. :
    The word problem for finitely presented monoids and finite canonical rewriting systems.
    In Lescanne, P., editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science 256, pages 74-82. Springer-Verlag, Berlin.

    1986:

    Book, R. and Otto, F. :
    The verifiability of two-party protocols.
    In Pichler, F., editor, Advances in Cryptology - EUROCRYPT'85, Lecture Notes in Computer Science 219, pages 254-260. Springer-Verlag, Berlin.

    1985:

    Otto, F. :
    Deciding algebraic properties of monoids presented by finite Church-Rosser Thue systems.
    In Jouannaud, J., editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science 202, pages 95-106. Springer-Verlag, Berlin.

    Technical Reports:
  • 2011, 2010,
  • 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000
  • 1999, 1998, 1997, 1996, 1995, 1994

    • Technical Reports in 2011:

    Nagy, B. and Otto, F.:
    On Globally Deterministic CD-Systems of Stateless R-Automata with Window Size One
    Kasseler Informatikschriften (KIS) 4/2010, Universität Kassel, March 2011
    Nagy, B. and Otto, F.:
    CD-Systems of Stateless Deterministic R(1)-Automata Governed by an External Pushdown Store
    Kasseler Informatikschriften (KIS) 1/2011, Universität Kassel, January 2011

    Technical Reports in 2010:

    Nagy, B. and Otto, F.:
    CD-Systems of Stateless Deterministic R-Automata with Window Size One
    Kasseler Informatikschriften (KIS) 2/2010, Universität Kassel, April 2010.

    Technical Reports in 2008:

    Pardubska, D., Plátek, M. and Otto, F.:
    On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
    Kasseler Informatikschriften (KIS) 4/2008, Universität Kassel, November 2008.
    Otto, F.:
    Lower bounds for nonforgetting restarting automata and CD-systems of restarting automata
    Kasseler Informatikschriften (KIS) 2/2008, Universität Kassel, Oktober 2008.
    Pardubska, D., Plátek, M. and Otto, F.:
    On the Correspondence between Parallel Communicating Grammar Systems and Restarting Automata
    Technical Report TR-2008-015, Fakulta Matematiky, Fysiky a Informatiky, Comenius University Bratislava, 2008.

    Technical Reports in 2007:

    Moriya, E. and Otto, F.:
    On alternating non-context-free grammars
    Kasseler Informatikschriften (KIS) 6/2007, Universität Kassel, November 2007.
    Mráz, F., Otto, F. and Plátek, M.:
    The Degree of Word-Expansion of Lexicalized RRWW-Automata - A New Measure for The Degree of Nondeterminism of (Context-Free) Languages
    Kasseler Informatikschriften (KIS) 5/2007, Universität Kassel, November 2007.

    Technical Reports in 2006:

    Kambites, M. and Otto, F.:
    Church-Rosser groups and growing context-sensitive groups
    Mathematische Schriften Kassel 7/06, Universität Kassel, August 2006.
    Messerschmidt, H., Mráz, F., Otto, F. and Plátek, M.:
    On the descriptional complexity of simple RL-automata
    Mathematische Schriften Kassel 4/06, Universität Kassel, April 2006.
    Mráz, F., Otto, F. and Plátek, M.:
    On the Gap-Complexity of Simple RL-Automata
    Mathematische Schriften Kassel 2/06, Universität Kassel, März 2006.
    Presented at Conference on Developments in Language Theory, DLT 2006.

    Technical Reports in 2005:

    Kambites, M. and Otto, F.:
    Uniform decision problems in automatic semigroups
    arXiv:math.RA/0509349.
    Mráz, F., Otto, F. and Plátek, M.:
    Learning analysis by reduction from positive data
    Mathematische Schriften Kassel 7/05, Universität Kassel, September 2005.
    Mráz, F., Otto, F. and Plátek, M.:
    Degrees of Free Word-Order and Freely Rewriting Restarting Automata
    Mathematische Schriften Kassel 5/05, Universität Kassel, Juli 2005.
    Jurdzinski, T. and Otto, F.:
    Restarting Automata with Restricted Utilization of Auxiliary Symbols
    Mathematische Schriften Kassel 2/05, Universität Kassel, April 2005.
    Presented at Tenth International Conference on Implementation and Application of Automata, CIAA 2005.
    Jurdzinski, T. and Otto, F.:
    Shrinking restarting automata
    Mathematische Schriften Kassel 1/05, Universität Kassel, Februar 2005.
    Presented at Mathematical Foundations of Computer Science, MFCS 2005.

    Technical Reports in 2004:

    Jurdzinski, T., Mráz, F., Otto, F. and Plátek, M.:
    Cut hierarchies for restarting automata and Marcus t-contextual grammars
    Mathematische Schriften Kassel 21/04, Universität Kassel, Dezember 2004.
    Presented at Conference on Algebraic Informatics, CAI 2005.
    Jurdzinski, T., Mráz, F., Otto, F. and Plátek, M.:
    Deterministic two-way restarting automata and Marcus contextual grammars
    Mathematische Schriften Kassel 18/04, Universität Kassel, November 2004.
    Published in revised form in Fundamenta Informaticae.
    Jurdzinski, T. and Otto, F.:
    Sequential monotonicity for restarting automata
    Mathematische Schriften Kassel 10/04, Universität Kassel, September 2004.
    Presented at ITAT 2004, Information Technologies - Applications and Theory.
    Jurdzinski, T., Mráz, F., Otto, F. and Plátek, M.:
    Deterministic two-way restarting automata don't need auxiliary symbols if they are (right-, left-, or right-left-) monotone
    Mathematische Schriften Kassel 7/04, Universität Kassel, September 2004.
    Presented at Developments in Language Theory, DLT 2005.
    Otto, F.:
    Restarting Automata - Notes for a Course at the 3rd International PhD School in Formal Languages and Applications
    Mathematische Schriften Kassel 6/04, Universität Kassel, Juni 2004.
    Jurdzinski, T., Otto, F., Mráz, F. and Plátek, M.:
    On the complexity of 2-monotone restarting automata
    Mathematische Schriften Kassel 4/04, Universität Kassel, Juni 2004.
    Presented at Developments in Language Theory, DLT 2004.
    Moriya, E., Hofbauer, D., Huber, M. and Otto, F.:
    On State-Alternating Context-free Grammars.
    Mathematische Schriften Kassel 1/04, Universität Kassel, Februar 2004.
    Published in revised form in Theoretical Computer Science.

    Technical Reports in 2003:

    Moriya, E., Hofbauer, D., Huber, M. and Otto, F.:
    On State-Alternating Context-free Grammars - With Detailed Proofs and Supplementary Results -.
    Technical Report 2003-5, Advanced Research Institute for Science and Engineering, Waseda University, November 2003.
    Otto, F., and Jurdzinski, T.:
    On left-monotone restarting automata.
    Mathematische Schriften Kassel 17/03, Universität Kassel, November 2003.
    Presented in revised form at Developments in Language Theory, DLT 2004.
    Pride, Stephen J., and Otto, F.:
    Relative monoid presentations and finite derivation type.
    Mathematische Schriften Kassel 15/03, Universität Kassel, September 2003.
    Pride, Stephen J., and Otto, F.:
    On higher order homological finiteness of rewriting systems.
    Mathematische Schriften Kassel 12/03, Universität Kassel, August 2003.
    Published in revised form in Journal of Pure and Applied Algebra.
    Plátek, M., Otto, F., Mráz, F. and Jurdzinski, T.:
    Restarting automata and variants of j-monotonicity
    Mathematische Schriften Kassel 9/03, Universität Kassel, Oktober 2003.
    Mraz, F. and Otto, F.:
    Hierarchies of weakly monotone restarting automata.
    Mathematische Schriften Kassel 8/03, Universität Kassel, April 2003.
    Published in revised form in RAIRO Informatique Théorique et Applications.
    Otto, F.:
    Restarting automata and their relations to the Chomsky hierarchy.
    Mathematische Schriften Kassel 5/03, Universität Kassel, March 2003.
    Invited talk at DLT'2003, published in shortened form in the Proceedings of DLT'2003
    Otto, F. and Moriya, E.:
    Shrinking alternating two-pushdown automata.
    in: New Aspects of Theoretical Computer Science, RIMS Kokyuroku 1325, pages 191-196. Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan, May 2003.

    Technical Reports in 2002:

    Pride, Stephen J. and Otto, Friedrich:
    For Rewriting Systems the Topological Finiteness Conditions FDT, FHT are not Equivalent.
    Mathematische Schriften Kassel 13/02, Universität Kassel, Juli 2002.
    Published in revised form in The Journal of the London Mathematical Society.
    Otto, F. and Sokratova, O.:
    Rewriting methods for monoid semirings.
    Mathematische Schriften Kassel 6/02, Universität Kassel, April 2002.
    Published in revised form in Journal of Symbolic Computation.

    Technical Reports in 2001:

    Jurdzinski, T., Lorys, K., Niemann, G. and Otto, F.:
    Some results on RRW- and RRWW-automata and their relationship to the class of growing context-sensitive languages.
    Mathematische Schriften Kassel 14/01, Universität-GH Kassel, December 2001.
    Otto, F. and Moriya, E.:
    Shrinking alternating two-pushdown automata.
    Mathematische Schriften Kassel 12/01, Universität-GH Kassel, August 2001.
    Published in revised form in IEICE Trans. Inf. & Syst..
    Otto, F.:
    Some results on Green's relations for monoids presented by monadic string-rewriting systems.
    Mathematische Schriften Kassel 9/01, Universität-GH Kassel, Juli 2001.
    Published in revised form in     Semigroup Forum.
    Niemann, G. and Otto F.:
    On the power of RRWW-automata.
    Mathematische Schriften Kassel 8/01, Universität-GH Kassel, Mai 2001.
    Published in revised form in Ito, M. et al (eds.), Words, Semigroups and Transductions; World Scientific, 2001.
    Kobayashi, Y. and Otto, F.:
    For finitely presented monoids the homological finiteness conditions FHT and bi-FP3 coincide.
    Mathematische Schriften Kassel 4/01, Universität-GH Kassel, März 2001.
    Published in revised form in Journal of Algebra.
    Katsura, M., Kobayashi, Y. and Otto, F.:
    Undecidable properties of monoids with word problem solvable in linear time - II. Cross-sections and homological and homotopical finiteness conditions.
    Mathematische Schriften Kassel 2/01, Universität-GH Kassel, Januar 2001.
    Results presented at ISAAC'2000.
    Published in revised form in Theoretical Computer Science.

    Technical Reports in 2000:

    Beaudry, M., Holzer, M., Niemann, G. and Otto, F.:
    McNaughton Languages.
    Mathematische Schriften Kassel 26/00, Universität-GH Kassel, November 2000.
    Results presented at DLT'2001.
    An extended version has been published in Theoretical Computer Science.
    Otto, F. and Ruskuc, N.:
    Confluent monadic string-rewriting systems and automatic structures.
    Mathematische Schriften Kassel 25/00, Universität-GH Kassel, Oktober 2000.
    Published in revised form in Journal of Automata, Languages and Combinatorics.
    Kobayashi, Y. and Otto, F.:
    Some exact sequences for the homotopy (bi-) module of a monoid.
    Mathematische Schriften Kassel 18/00, Universität-GH Kassel, Juni 2000.
    Published in revised form in Int. Journal of Algebra and Computation.
    Kobayashi, Y. and Otto, F.:
    On homotopical and homological finiteness conditions for finitely presented monoids.
    Mathematische Schriften Kassel 1/00, Universität-GH Kassel, Januar 2000.
    Published in revised form in Int. Journal of Algebra and Computation.

    Technical Reports in 1999:

    Niemann, G. and Otto, F.:
    Restarting automata and prefix-rewriting systems.
    Mathematische Schriften Kassel 18/99, Universität-GH Kassel, Dezember 1999.
    Results presented at the 3rd International Conference on Words, Languages and Combinatorics.
    Niemann, G. and Otto, F. (Hrsg):
    9. Theorietag der GI-Fachgruppe 0.1.5 "Automaten und Formale Sprachen".
    Schauenburg-Elmshagen bei Kassel, 27.-29. September 1999.
    Mathematische Schriften Kassel 12/99, Universität-GH Kassel, September 1999.
    Otto, F.:
    On the connections between rewriting and formal language theory.
    Mathematische Schriften Kassel 5/99, Universität-GH Kassel, März 1999.
    Invited talk presented at RTA'99, published in revised form in the Proceedings of RTA'99.
    Niemann, G. and Otto, F.:
    Restarting automata, Church-Rosser languages, and confluent internal contextual languages.
    Mathematische Schriften Kassel 4/99, Universität-GH Kassel, März 1999.
    Results presented at DLT'99, published in revised form in the Proceedings of DLT'99.

    Technical Reports in 1998:

    Otto, F. :
    A survey on the computational power of some classes of finite monoid-presentations.
    Mathematische Schriften Kassel 12/98, Universität-GH Kassel, September 1998.
    Presented at International Conference on Algorithmic Problems in Groups and Semigroups.
    Cremanns, R. and Otto, F. :
    FP_\infty is undecidable for finitely presented monoids with word problems decidable in polynomial time.
    Mathematische Schriften Kassel 11/98, Universität-GH Kassel, September 1998.
    Otto, F. :
    On s-regular prefix-rewriting systems and automatic structures.
    Mathematische Schriften Kassel 9/98, Universität-GH Kassel, September 1998.
    Results presented at COCOON'99.
    Otto, F. :
    On Dehn functions of finitely presented bi-automatic monoids.
    Mathematische Schriften Kassel 8/98, Universität-GH Kassel, Juli 1998.
    Published in revised form in Journal of Automata, Languages and Combinatorics.
    Cremanns, R. and Otto, F. :
    A Completion Procedure for Finitely Presented Groups that is Based on Word Cycles.
    Mathematische Schriften Kassel 1/98, Universität-GH Kassel, März 1998.
    Published in revised form in Journal of Automated Reasoning.

    Technical Reports in 1997:

    Kobayashi, Y. and Otto, F. :
    Repetitiveness of languages generated by morphisms.
    Mathematische Schriften Kassel 2/97, Universität-GH Kassel, Februar 1997.
    Results presented at MFCS'97.
    Niemann, G. and Otto, F. :
    The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages.
    Mathematische Schriften Kassel 8/97, Universität-GH Kassel, August 1997.
    Results presented at FoSSaCS'98.
    Otto, F. :
    On properties of monoids that are modular for free products and for certain free products with amalgamated submonoids.
    Mathematische Schriften Kassel 6/97, Universität-GH Kassel, June 1997.
    Published in revised form.
    Otto, F. :
    Uniform decision problems for certain restricted classes of finite monoid-presentations - A survey on recent undecidability results.
    Mathematische Schriften Kassel 11/97, Universität-GH Kassel, October 1997.
    Published in revised form in Semigroups and Applications.
    Otto, F. and Sattler-Klein, A. :
    FDT is undecidable for finitely presented monoids with solvable word problems.
    Mathematische Schriften Kassel 3/97, Universität-GH Kassel, March 1997.
    Results presented at FCT'97.
    Otto, F. and Sattler-Klein, A. :
    Some remarks on finitely presented monoids with automatic structure.
    Mathematische Schriften Kassel 9/97, Universität-GH Kassel, August 1997.
    Results presented at RTA'98.

    Technical Reports in 1996:

    Katsura, M., Kobayashi, Y., and Otto, F. :
    Infinite convergent string-rewriting systems and cross-sections for monoids
    Mathematische Schriften Kassel 3/96, Universität-GH Kassel.
    Published in revised form in Journal of Symbolic Computation.
    Madlener, K. and Otto, F. :
    Some undecidability results for finitely generated Thue congruences on a two-letter alphabet.
    Mathematische Schriften Kassel 10/96, Universität-GH Kassel.
    Published in revised form in Fundamenta Informaticae.
    Narendran, P. and Otto, F. :
    The word matching problem is undecidable in general for finite special string-rewriting systems that are confluent.
    Mathematische Schriften Kassel 7/96, Universität-GH Kassel.
    Published in Automata, Languages and Programming in extended and revised form.
    Otto, F. :
    Preserving regularity and related properties of string-rewriting systems.
    Mathematische Schriften Kassel 6/96, Universität-GH Kassel.
    Published in revised form in Theoretical Computer Science.
    Otto, F. and Kobayashi, Y. :
    Properties of monoids that are presented by finite convergent string-rewriting systems - a survey.
    Mathematische Schriften Kassel 2/96, Universität-GH Kassel.
    Published in revised form in Advances in Algorithms, Languages and Complexity.
    Otto, F., Narendran, P., and Dougherty, D. :
    Equational unification, word unification, and 2nd-order equational unification.
    Mathematische Schriften Kassel 8/96, Universität-GH Kassel.
    Published in revised form in Theoretical Computer Science.

    Technical Reports in 1995:

    Buntrock, G. and Otto, F. :
    Growing context-sensitive languages and Church-Rosser languages.
    Schriftenreihe der Institute für Informatik/Mathematik A-95-22, Medizinische Universität zu Lübeck.
    Published in revised form in     Information and Computation.

    Technical Reports in 1994:

    Cremanns, R. and Otto, F. :
    For groups the property of having finite derivation type is equivalent to the homological finiteness condition FP_3.
    Mathematische Schriften Kassel 8/94, Universität-GH Kassel.
    Published in revised form in Journal of Symbolic Computation.
    Otto, F. :
    Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general.
    Mathematische Schriften Kassel 6/94, Universität-GH Kassel.
    Published in revised form in Information Processing Letters.
    Otto, F. :
    Some decision problems related to the regularity of monoids.
    Mathematische Schriften Kassel 9/94, Universität-GH Kassel. Some of the results of this report have been announced at the conference on Semigroups, Automata and Languages, Porto, June 1994.
    Results presented in Semigroups, Automata and Languages.