Conditional semi-Thue systems for presenting monoids

  • Thomas Deiß
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 577)


There are well known examples of monoids in literature which do not admit a finite and canonical presentation by a semi-Thue system over a fixed alphabet, not even over an arbitrary alphabet. We introduce conditional Thue and semi-Thue systems similar to conditional term rewriting systems as defined by Kaplan. Using these conditional semi-Thue systems we give finite and canonical presentations of the examples mentioned above. Furthermore we show, that every finitely generated monoid with decidable word problem is embeddable in a monoid which has a finite canonical conditional presentation.


Word Problem Turing Machine Minimal Solution Critical Pair Conditional Equation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bau81]
    Günther Bauer. Zur Darstellung von Monoiden durch konfluente Regelsysteme. PhD thesis, Fachbereich Informatik, Universität Kaiserslautern, 1981. in German.Google Scholar
  2. [Boo85]
    Ronald V. Book. Thue systems as rewriting systems. In Proc. of 1st Rewriting Techniques and Applications, pages 63–94. Springer, 1985. LNCS 202.Google Scholar
  3. [Dav56]
    Martin D. Davis. A note on universal turing machines. In C. E. Shannon and J. McCarthy, editors, Automata Studies, pages 167–175. Princeton Press, 1956.Google Scholar
  4. [DW83]
    Martin D. Davis and Elaine J. Weyuker. Computability, Complexity, and Languages. Academic Press, 1983.Google Scholar
  5. [Gan87]
    Harald Ganzinger. A completion procedure for conditional equations. Technical Report 234, Fachbereich Informatik, Universität Dortmund, 1987.Google Scholar
  6. [Hue80]
    Gérard Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM, 27(4):797–821, oct 1980.Google Scholar
  7. [Jan88]
    Matthias Jantzen. Confluent String Rewriting. Springer, Berlin, Heidelberg, New York, 1988.Google Scholar
  8. [JW86]
    Jean Pierre Jouannaud and Bernard Waldmann. Reductive conditional term rewriting systems. In Proceedings of the 3rd IFIP Working Conference on Formal Description of Programming Concepts. North-Holland, 1986.Google Scholar
  9. [Kap84]
    Stephane Kaplan. Conditional rewrite rules. Theoretical Computer Science, 33:175–193, 1984.Google Scholar
  10. [Kap87]
    Stephane Kaplan. Simplifying conditional term rewriting systems: Unification, termination and confluence. Journal of Symbolic Computation, 4:295–334, 1987.Google Scholar
  11. [KH89]
    Helene Kirchner and Miki Hermann. Computing meta-rules from crossed rewrite systems. Technical report, CRIN, Nancy, 1989.Google Scholar
  12. [KN85]
    Deepak Kapur and Paliath Narendran. A finite Thue system with decidable word problem and without equivalent finite canonical system. Theoretical Computer Science, 35:337–344, 1985.Google Scholar
  13. [Man74]
    Zohar Manna. Mathematical Theory of Computation. Computer Science Series. McGraw-Hill, 1974.Google Scholar
  14. [Sat91]
    Andrea Sattler-Klein. Divergence phenomena during completion. In Ronald V. Book, editor, Proc. of 4th Rewriting Techniques and Applications, pages 374–385. Springer, 1991. LNCS 488.Google Scholar
  15. [Sim87]
    C. C. Sims. Verifying nilpotence. Journal of Symbolic Computation, 3:231–247, 1987.Google Scholar
  16. [Squ87]
    Craig Squier. Word problems and a homological finiteness condition for monoids. Journal of pure and applied algebra, 49:201–217, 1987.Google Scholar
  17. [Squ88]
    Craig Squier. A finiteness condition for rewriting systems. Department of Mathematical Sciences, SUNY-Binghamton, Binghamton, NY 13901, 1988.Google Scholar
  18. [SS63]
    J. C. Shepherdson and H. E. Sturgis. Computability of recursive functions. Journal of the ACM, 10:217–255, 1963.Google Scholar
  19. [SS82]
    Jörg Siekmann and P. Szabo. A noetherian and confluent rewrite system for idempotent semigroups, semigroup forum, 25:83–110, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Thomas Deiß
    • 1
  1. 1.Fachbereich InformatikUniversität KaiserslauternKaiserslauternGermany

Personalised recommendations