Skip to main content
SpringerLink
Log in

Completing a finite special string-rewriting system on the congruence class of the empty word

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

Based on a polynomial-time test for determining whether a finite special string-rewriting systemR ise-confluent, a procedure for completing a finite special systemR on[e] R is derived. The correctness and completeness of this procedure are proved. In addition, the special case of finite special string-rewriting systems presenting groups is considered.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Book, R. V.: Decidable sentences of Church-Rosser congruences. Theor. Comput. Sci.23, 301–312 (1983)

    Google Scholar 

  2. Cochet, Y.: Church-Rosser congruences on free semigroups. In: Algebraic Theory of Semigroups. Colloquia Mathematica Societatis Janos Bolyai20, pp. 51–60. Amsterdam: North-Holland 1976

    Google Scholar 

  3. Kapur, D., Narendran, P.: The Knuth-Bendix completion procedure and Thue systems. SIAM J. Comput.14, 1052–1072 (1985)

    Google Scholar 

  4. LeChenadec, Ph.: Canonical Forms in Finitely Presented Algebras. London: Pitman, New York, Toronto: Wiley 1986

    Google Scholar 

  5. Lyndon, R. C., Schupp, P. E.: Combinatorial group theory. Berlin, Heidelberg, New York: Springer 1977

    Google Scholar 

  6. Madlener, K., Otto, F.: About the descriptive power of certain classes of finite string-rewriting systems. Theor. Comput. Sci.67, 143–172 (1989)

    Google Scholar 

  7. Madlener, K., Narendran, P., Otto, F.: A specialized completion procedure for monadic string-rewriting systems presenting groups. In: Albert, J. L., Monien, B., Artalejo, M. R. (eds.) Automata, Languages, and Programming. Proceedings of the 18th Int. Coll, Lecture Notes Computer Science, Vol. 510, pp. 279–290. Berlin, Heidelberg, New York: Springer 1991

    Google Scholar 

  8. Narendran, P., O'Dunlaing, C., Otto, F.: It is Undecidable Whether a Finite Special String-Rewriting System Presents a Group. Discrete Math, (to appear)

  9. O'Dunlaing, C.: Finite and Infinite Regular Thue Systems; Ph.D. Dissertation, Department of Mathematics, University of California at Santa Barbara (1981)

    Google Scholar 

  10. Otto, F.: On deciding the confluence of a finite string-rewriting system on a given congruence class. J. Comp. Sys. Sci.35, 285–310 (1987)

    Google Scholar 

  11. Otto, F.: The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems. Preprint No. 4/90, FB Math., GhK Kassel, West Germany (1990); also: Math. Systems Theory (to appear)

    Google Scholar 

  12. Otto, F., Zhang, L.: Decision problems for finite special string-rewriting systems that are confluent on a given congruence class. Acta Informatica28, 477–510 (1991)

    Google Scholar 

  13. Zhang, L.: Conjugacy in special monoids. J. Algebra143, 487–497 (1991)

    Google Scholar 

  14. Zhang, L.: The word problem and Markov properties for finitely presented special monoids. Submitted for publication

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik/Informatik, Gesamthochschule Kassel, Postfach 101380, W-3500, Kassel, FRG

    Friedrich Otto

Authors
  1. Friedrich Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Otto, F. Completing a finite special string-rewriting system on the congruence class of the empty word. AAECC 2, 257–274 (1992). https://doi.org/10.1007/BF01614148

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation