Skip to main content
SpringerLink
Log in

FDT is undecidable for finitely presented monoids with solvable word problems

  • Technical Contributions
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1279))

Included in the following conference series:

Abstract

Exploiting a new technique for proving undecidability results developed by A. Sattler-Klein in her doctoral dissertation (1996) it is shown that it is undecidable in general whether or not a finitely presented monoid with a solvable word problem has finite derivation type (FDT). This improves upon the undecidability result of R. Cremanns and F. Otto (1996), which was based on the undecidability of the word problem for the finitely presented monoids considered.

This work was supported by the Deutsche Forschungsgemeinschaft (Projekte Ma 1208/5-1 und Ot 79/4-1).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.V. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, New York, 1993.

    Google Scholar 

  2. R. Cremanns and F. Otto. Finite derivation type implies the homological finiteness condition FP 3. J. Symbolic Computation, 18:91–112, 1994.

    Article  Google Scholar 

  3. R. Cremanns and F. Otto. For groups the property of having finite derivation type is equivalent to the homological finiteness condition FP 3. J. Symbolic Computation, 22:155–177, 1996.

    Article  Google Scholar 

  4. V. Diekert. Private communication. March 1997.

    Google Scholar 

  5. D. Knuth and P. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263–297. Pergamon Press, New York, 1970.

    Google Scholar 

  6. Y. Kobayashi. Complete rewriting systems and homology of monoid algebras. J. Pure Applied Algebra, 65:263–275, 1990.

    Article  Google Scholar 

  7. Y. Lafont. A finiteness condition for monoids presented by complete rewriting systems (after C. C. Squier). J. Pure Applied Algebra, 98:229–244, 1995.

    Article  Google Scholar 

  8. F. Otto and Y. Kobayashi. Properties of monoids that are presented by finite convergent string-rewriting systems-a survey. In D.Z. Du and K. Ko, editors, Advances in Algorithms, Languages, and Complexity. Kluwer Academic Publ., Dordrecht, 1997, pp. 226–266.

    Google Scholar 

  9. F. Otto and A. Sattler-Klein.FDT is undecidable for finitely presented monoids with solvable word problems. Preprint No. 3/97, Universität Kassel, Fachbereich Mathematik/Informatik, March 1997.

    Google Scholar 

  10. F. Otto and A. Sattler-Klein. Some remarks on finitely presented monoids with automatic structure. In preparation.

    Google Scholar 

  11. F. Otto. Modular properties of monoids and string-rewriting systems. In preparation.

    Google Scholar 

  12. S.J. Pride. Low-dimensional homotopy theory for monoids. International Journal of Algebra and Computation, 5:631–649, 1995.

    Article  Google Scholar 

  13. A. Sattler-Klein. Divergence phenomena during completion. In R.V. Book, editor, Rewriting Techniques and Applications, pages 374–385. Springer-Verlag, Berlin, 1991. Lecture Notes in Computer Science 488.

    Google Scholar 

  14. A. Sattler-Klein. A systematic study of infinite canonical systems generated by Knuth-Bendix completion and related problems. Doctoral Dissertation, Fachbereich Informatik, Universität Kaiserslautern, February 1996.

    Google Scholar 

  15. A. Sattler-Klein. New undecidability results for finitely presented monoids. In H. Comon, editor, Rewriting Techniques and Applications. Springer-Verlag, Berlin, 1997. Lecture Notes in Computer Science 1232, to appear.

    Google Scholar 

  16. C.C. Squier, F. Otto, and Y. Kobayashi. A finiteness condition for rewriting systems. Theoretical Computer Science, 131:271–294, 1994.

    Article  Google Scholar 

  17. C.C. Squier. Word problems and a homological finiteness condition for monoids. J. Pure Applied Algebra, 49:201–217, 1987.

    Article  Google Scholar 

  18. Y. Toyama, J.W. Klop, and H.P. Barendregt. Termination for direct sums of left-linear complete term rewriting systems. J. Assoc. for Comput. Machinery, 42:1275–1304, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik/Informatik, Universität Kassel, D-34109, Kassel

    Friedrich Otto

  2. Fachbereich Informatik, Universität Kaiserslautern, D-67653, Kaiserslautern

    Andrea Sattler-Klein

Authors
  1. Friedrich Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrea Sattler-Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bogdan S. Chlebus Ludwik Czaja

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Otto, F., Sattler-Klein, A. (1997). FDT is undecidable for finitely presented monoids with solvable word problems. In: Chlebus, B.S., Czaja, L. (eds) Fundamentals of Computation Theory. FCT 1997. Lecture Notes in Computer Science, vol 1279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036200

Download citation

  • DOI: https://doi.org/10.1007/BFb0036200

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63386-0

  • Online ISBN: 978-3-540-69529-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation