Skip to main content
SpringerLink
Log in

Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems — A Survey

  • Chapter
Advances in Algorithms, Languages, and Complexity

Abstract

In recent years a number of conditions have been established that a monoid must necessarily satisfy if it is to have a presentation through some finite convergent string-rewriting system. Here we give a survey on this development, explaining these necessary conditions in detail and describing the relationships between them.

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. S.I. Adjan. The Burnside Problem and Identities in Groups. Springer- Verlag, Berlin, 1979.

    MATH  Google Scholar 

  2. D.J. Anick. On the homology of associative algebras. Transactions American Mathematical Society, 296: 641 - 659, 1986.

    Article  MathSciNet  MATH  Google Scholar 

  3. J. Avenhaus and K. Madlener. Subrekursive Komplexitat bei Gruppen: I. Gruppen mit vorgeschriebener Komplexitat. Acta Informatica, 9: 87 – 104, 1977.

    Article  MathSciNet  MATH  Google Scholar 

  4. J. Avenhaus and K. Madlener. Subrekursive Komplexität bei Gruppen: II. Der Einbettungssatz von Higman für entscheidbare Gruppen. Acta Informatica, 9: 183 – 193, 1978.

    Article  MathSciNet  MATH  Google Scholar 

  5. J. Berstel. Congruences plus que parfaites et langages algébriques. In Seminaire d’Informatique Théorique, pages 123–147. Institute de Programmation, 1976–77.

    Google Scholar 

  6. R. Bieri. Homological dimension of discrete groups. Mathematics Notes, Queen Mary College, London, 1976.

    Google Scholar 

  7. R.V. Book, M. Jantzen, and C. Wrathall. Monadic Thue systems. Theoretical Computer Science, 19: 231–251, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  8. B. Benninghofen, S. Kemmerich, and M.M. Richter. Systems of Reductions. Lecture Notes in Computer Science 277. Springer-Verlag, Berlin, 1987.

    Google Scholar 

  9. G. Bauer and F. Otto. Finite complete rewriting systems and the complexity of the word problem. Acta Informatica, 21: 521–540, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  10. R.V. Book and C. Ó’Dúnlaing. Thue congruences and the Church-Rosser property. Semigroup Forum, 22: 367–379, 1981.

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  12. R.V. Book. Confluent and other types of Thue systems. J. Association Computing Machinery, 29: 171–182, 1982.

    MathSciNet  MATH  Google Scholar 

  13. R.V. Book. Decidable sentences of Church-Rosser congruences. Theoretical Computer Science, 24: 301–312, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  14. R.V. Book. Homogeneous Thue systems and the Church-Rosser property. Discrete Mathematics, 48: 137–145, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  15. R. Brown and J. Huebschmann. Identities among relations. In R. Brown et al, editors, Low-Dimensional Topology, Cambridge University Press, 1982.

    Chapter  Google Scholar 

  16. K.S. Brown. Cohomology of Groups. Springer-Verlag, New York - Heidelberg - Berlin, 1982.

    MATH  Google Scholar 

  17. K.S. Brown. The geometry of rewriting systems: A proof of the Anick- Groves-Squier theorem. In G. Baumslag and C.F. Miller III, editors, Algorithms and Classification in Combinatorial Group Theory, Math. Sciences Research Institute Publ. 23, pages 137–163. Springer-Verlag, Berlin, 1992.

    Google Scholar 

  18. D.E. Cohen. A monoid which is right FP∞ but not left FP1. Bull. London Math. Soc., 24: 340–342, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  19. R. Cremanns and F. Otto. Finite derivation type implies the homological finiteness condition FP3. Journal of Symbolic Computation, 18: 91–112, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  20. R. Cremanns and F. Otto. For groups the property of having finite derivation type is equivalent to the homological finiteness condition FP 3 . Journal of Symbolic Computation, to appear.

    Google Scholar 

  21. R. Cremanns. Finiteness conditions for rewriting systems. PhD thesis, Universität Gh Kassel, 1995.

    Google Scholar 

  22. M. Davis. Computability and Unsolvability. McGraw-Hill, 1958. Reprinted by Dover, 1982.

    Google Scholar 

  23. V. Diekert. Complete semi-Thue systems for abelian groups. Theoretical Computer Science, 44: 199–208, 1986.

    Article  MathSciNet  MATH  Google Scholar 

  24. D.B.A. Epstein. Word Processing In Groups. Jones and Bartlett Publishers, 1992.

    Google Scholar 

  25. R. Gilman. Presentations of groups and monoids. J. Algebra, 57: 544–554, 1979.

    Article  MathSciNet  MATH  Google Scholar 

  26. J.R.J. Groves. Rewriting systems and homology of groups. In: Groups — Canberra 1989, Lecture Notes in Mathematics 1456, pages 114–141. Springer-Verlag, Berlin, 1991.

    Google Scholar 

  27. A. Grzegorczyk. Some classes of recursive functions. Rozprawy Matematycne, 4: 1–45, 1953.

    MathSciNet  Google Scholar 

  28. P.J. Higgins. Notes on Categories and Groupoids, van Nostrand, 1971.

    Google Scholar 

  29. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, New York, 1979.

    MATH  Google Scholar 

  30. M. Jantzen. A note on a special one-rule semi-Thue system. Information Processing Letters, 21: 135–140, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  31. D. Kapur, M. Krishnamoorthy, R. McNaughton, and P. Narendran. An O (|T|3) algorithm for testing the Church-Rosser property of Thue systems. Theoretical Computer Science, 35: 109–114, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  32. D. Kapur and P. Narendran. A finite Thue system with decidable word problem and without equivalent finite canonical system. Theoretical Computer Science, 35: 337–344, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  33. D. Kapur and P. Narendran. The Knuth-Bendix completion procedure and Thue systems. SIAM J. Computing, 14: 1052–1072, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  34. M. Katsura and Y. Kobayashi. Constructing finitely presented monoids which have no finite complete presentation. Semigroup Forum, to appear.

    Google Scholar 

  35. M. Katsura and Y. Kobayashi. Monoids with rational cross-section. Manuscript, 1996.

    Google Scholar 

  36. 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 

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

    Article  MATH  Google Scholar 

  38. Y. Kobayashi. A finitely presented monoid which has solvable word problem but has no regular complete presentation. Theoretical Computer Science, 146: 321–329, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  39. 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  MathSciNet  MATH  Google Scholar 

  40. G. Lallement. Semigroups and Combinatorial Applications. Wiley- Interscience, New York, 1979.

    MATH  Google Scholar 

  41. R.C. Lyndon and P.E. Schupp. Combinatorial Group Theory. Springer- Verlag, Berlin, 1977.

    MATH  Google Scholar 

  42. M. Machtey. On the density of honest subrecursive classes. J. Computer System Sciences, 10: 183–199, 1975.

    Article  MathSciNet  MATH  Google Scholar 

  43. C.F. Miller. Decision problems for groups — survey and reflections. In G. Baumslag and C.F. Miller III, editors, Algorithms and Classification in Combinatorial Group Theory, Math. Sciences Research Institute Publ. 23, pages 1–59. Springer-Verlag, New York, 1992.

    Google Scholar 

  44. W. Magnus, A. Karrass, and D. Solitar. Combinatorial Group Theory. Dover, 1976.

    Google Scholar 

  45. K. Madlener and F. Otto. Pseudo-natural algorithms for the word problem for finitely presented monoids and groups. Journal of Symbolic Computation, 1: 383–418, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  46. K. Madlener and F. Otto. Decidable sentences for context-free groups. In C. Choffrut and M. Jantzen, editors, Proceedings STACS’91, Lecture Notes in Computer Science 480, pages 160–171. Springer-Verlag, Berlin, 1991.

    Google Scholar 

  47. C. Ó’Dúnlaing. Finite and Infinite Regular Thue Systems. PhD thesis. University of California, Santa Barbara, 1981.

    Google Scholar 

  48. C. Ó’Dúnlaing. Infinite regular Thue systems. Theoretical Computer Science, 25: 171–192, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  49. C. Ó’Dúnlaing. Undecidable questions related to Church-Rosser Thue systems. Theoretical Computer Science, 23: 339–345, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  50. F. Otto. Some undecidability results for non-monadic Church-Rosser Thue systems. Theoretical Computer Science, 33: 261–278, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  51. F. Otto and C. Wrathall. A note on Thue systems with a single defining relation. Mathematical Systems Theory, 18: 135–143, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  52. F. Otto and L. Zhang. Decision problems for finite special string-rewriting systems that are confluent on some congruence class. Acta Informatica, 28: 477–510, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  53. R. Peiffer. Uber Identitaten zwischen Relationen. Mathematische Annalen, 121: 67–99, 1949.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  57. G.J. Tourlakis. Computability. Reston Publ. Co., Reston, VA 1984.

    MATH  Google Scholar 

  58. V. Ufranowski. The growth criterion for graphs and algebras defined by words. Mat. Zametki, 31: 465–472, 1982 (in Russian).

    MathSciNet  Google Scholar 

  59. K. Weihrauch. Teilklassen primitiv-rekursiver Wortfunktionen. Bericht Nr. 91, GMD Bonn, 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik/Informatik, Universität — Gh Kassel, 34109, Kassel, Germany

    F. Otto

  2. Department of Information Science, Faculty of Science, Toho University, Funabashi, 274, Japan

    Y. Kobayashi

Authors
  1. F. Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Y. Kobayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Minnesota, USA

    Ding-Zhu Du

  2. State University of New York, Stony Brook, USA

    Ker-I Ko

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Kluwer Academic Publishers

About this chapter

Cite this chapter

Otto, F., Kobayashi, Y. (1997). Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems — A Survey. In: Du, DZ., Ko, KI. (eds) Advances in Algorithms, Languages, and Complexity. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3394-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-3394-4_12

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-3396-8

  • Online ISBN: 978-1-4613-3394-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation