Skip to main content
SpringerLink
Log in

Efficient rewriting in cograph trace monoids

  • Communications
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1995)

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

Included in the following conference series:

  • 147 Accesses

Abstract

We consider the basic problem of finding irreducible forms w.r.t. a finite noetherian rewriting system over a free partially commutative monoid where the underlying dependence alphabet is a cograph. A linear time algorithm is developed which determines irreducible normal forms w.r.t. finite, length-reducing trace rewriting systems over cograph monoids. This generalizes well-known results for free monoids and commutative monoids and is a significant improvement to the previously known square time algorithm.

Partially supported by the ESPRIT Basic Research Action No. 6317 ASMICS II.

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. I.J. Aalbersberg and G. Rozenberg. Theory of traces. Theoretical Computer Science, 60:1–82, 1988.

    Article  Google Scholar 

  2. A.V. Aho Algorithms for finding patterns in strings Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, Elsevier 1990

    Google Scholar 

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

    Google Scholar 

  4. P. Cartier and D. Foata. Problèmes combinatoires de commutation et réarrangements. Lecture Notes in Mathematics 85. Springer, 1969.

    Google Scholar 

  5. V. Diekert and G. Rozenberg. The Book of Traces. World Scientific, 1995.

    Google Scholar 

  6. V. Diekert. Combinatorics on Traces. Number 454 in Lecture Notes in Computer Science. Springer, 1990.

    Google Scholar 

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

    Google Scholar 

  8. A. Mazurkiewicz. Trace theory. In W. Brauer et al., editors, Petri Nets, Applications and Relationship to other Models of Concurrency, number 255 in Lecture Notes in Computer Science, pages 279–324, Springer, 1987.

    Google Scholar 

  9. Vaughan Pratt. Modeling concurrency with partial orders. International Journal of Parallel Processing, 15(1):33–71, 1986.

    Google Scholar 

  10. Jan Grabowski. On partial languages. Fundamenta Informatica, IV(2):427–498, 1981.

    Google Scholar 

  11. J. Valdes, R. E. Tarjan, and E. L. Lawler. The recognition of series-parallel digraphs. SIAM Journal of Computing, 11(2):298–313, 1981.

    Google Scholar 

  12. E.S. Wolk. A note on “The comparabitily graph of a tree”. Amer. Math. Soc., 16:17–22, 1965.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Stuttgart, Breitwiesenstr. 20-22, D-70565, Stuttgart

    Michael Bertol

Authors
  1. Michael Bertol
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Horst Reichel

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bertol, M. (1995). Efficient rewriting in cograph trace monoids. In: Reichel, H. (eds) Fundamentals of Computation Theory. FCT 1995. Lecture Notes in Computer Science, vol 965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60249-6_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-60249-6_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60249-1

  • Online ISBN: 978-3-540-44770-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation