Skip to main content
SpringerLink
Log in

Finite canonical rewriting systems for congruences generated by concurrency relations

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

WhenC is a concurrency relation on alphabet Σ, then Σ*/= C is a free partially commutative monoid. Here we show that it is decidable in polynomial time whether or not there exists a finite canonical rewriting systemR on Σ such that the congruences ↔ *R generated byR and = C induced byC coincide. Further, in case such a systemR exists, one such system can be determined in polynomial time.

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. J. Avenhaus and K. Madlener, String matching and algorithmic problems in free groups,Rev. Colombiana Mat.,14 (1980), 1–16.

    Google Scholar 

  2. G. Bauer and F. Otto, Finite complete rewriting systems and the complexity of the word problem,Acta Inform.,21 (1984), 521–540.

    Google Scholar 

  3. R. V. Book, Confluent and other types of Thue systems,J. Assoc. Comput. Mach.,29 (1982), 171–182.

    Google Scholar 

  4. R. V. Book, A note on special Thue systems with a single defining relation,Math. Systems Theory,16 (1983), 57–60.

    Google Scholar 

  5. P. Cartier and D. Foata,Problemes Combinatoires de Commutation et Rearrangements, Lecture Notes in Mathematics, Vol. 85, Springer-Verlag, Berlin, 1969.

    Google Scholar 

  6. V. Diekert, Complete semi-Thue systems for abelian groups,Theoret. Comput. Sci.,44 (1986), 199–208.

    Google Scholar 

  7. M. C. Golumbic,Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.

    Google Scholar 

  8. G. Huet, Confluent reductions: abstract properties and applications to term rewriting systems,J. Assoc. Comput. Mach.,27 (1980), 797–821.

    Google Scholar 

  9. G. Huet and D. S. Lankford, On the uniform halting problem for term rewriting systems, Lab. Rep. No. 283, INRIA, Le Chesnay, 1978.

  10. M. Jantzen, A note on a special one-rule semi-Thue system,Inform. Process. Lett.,21 (1985), 135–140.

    Google Scholar 

  11. D. Kapur and P. Narendran, A finite Thue system with decidable word problem and without equivalent finite canonical system,Theoret. Comput. Sci.,35 (1985), 337–344.

    Google Scholar 

  12. A. Mazurkiewicz, Concurrent program schemes and their interpretations, DAIMI, PB 78, Aarhus University, 1977.

  13. Y. Metivier and E. Ochmanski, On lexicographic semi-commutations,Inform. Process. Lett., to appear.

  14. M. H. A. Newman, On theories with a combinatorial definition of equivalence,Ann. of Math.,43 (1943), 223–243.

    Google Scholar 

  15. M. Nivat and M. Benois, Congruences parfaites et quasi-parfaites,Seminaire Dubreil, 25 e Annee, 7-01-90, 1971–72.

  16. F. Otto and C. Wrathall, A note on Thue systems with a single defining relation,Math. Systems Theory,18 (1985), 135–143.

    Google Scholar 

  17. B. Rosen, Tree manipulating systems and the Church-Rosser property,J. Assoc. Comput. Mach.,20 (1973), 160–187.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, State University of New York, 12222, Albany, NY, USA

    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. Finite canonical rewriting systems for congruences generated by concurrency relations. Math. Systems Theory 20, 253–260 (1987). https://doi.org/10.1007/BF01692068

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation