Skip to main content
SpringerLink
Log in

On efficient reduction algorithms for some trace rewriting systems

  • Conference paper
  • First Online:
Term Rewriting (TCS School 1993)

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

Included in the following conference series:

Abstract

We consider some basic problems on the decidability and complexity of trace rewriting systems. The new contribution of this paper is an O(nlog(n)) algorithm for some computing irreducible normal forms in the case of certain one-rule systems.

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. Theoret. Comput. Sci., 60:1–82, 1988.

    Google Scholar 

  2. R.V. Book and F. Otto. String Rewriting Systems. Texts and Monographs in Computer Science. Springer Verlag, New York, 1993.

    Google Scholar 

  3. P. Cartier and D. Foata. Problèmes combinatoires de commutation et réarrangements. Number 85 in Lecture Notes in Mathematics. Springer, Berlin-Heidelberg-New York, 1969.

    Google Scholar 

  4. M. Clerbout. Commutations partielles et familles de langages. Thése, Université de Lille (France), 1984.

    Google Scholar 

  5. M. Clerbout and M. Latteux. Partial commutations and faithful rational transductions. Theoretical Computer Science, 35:241–254, 1985.

    Google Scholar 

  6. R. Cori and D. Perrin. Automates et commutations partielles. R.A.I.R.O. — Informatique Théorique et Applications, 19:21–32, 1985.

    Google Scholar 

  7. Max Dauchet. Termination of rewriting is undecidable in the one-rule case. In M. Chytil et al., editors, Proceedings of the 13th Symposium on Mathematical Foundations of Computer Science (MFCS'88), Carlsbad (CSSR) 1988, number 324 in Lecture Notes in Computer Science, pages 262–288, Berlin-Heidelberg-New York, 1988. Springer.

    Google Scholar 

  8. V. Diekert. Combinatorial rewriting on traces. In C. Choffrut et al., editors, Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science (STACS'90), Rouen (France) 1990, number 415 in Lecture Notes in Computer Science, pages 138–151, Berlin-Heidelberg-New York, 1990. Springer.

    Google Scholar 

  9. V. Diekert. Combinatorics on Traces. Number 454 in Lecture Notes in Computer Science. Springer, Berlin-Heidelberg-New York, 1990.

    Google Scholar 

  10. V. Diekert. Word problems over traces which are solvable in linear time. Theoret. Comput. Sci., 74:3–18, 1990.

    Google Scholar 

  11. V. Diekert. Rewriting, semi-commutations, and Möbius functions. In Z. Ésik, editor, Proc. of the 9th Fundamentals of Computation Theory (FCT 93), Szeged (Hungary) 1993, number 710 in Lecture Notes in Computer Science, pages 1–15, Berlin-Heidelberg-New York, 1993. Springer. Invited Lecture.

    Google Scholar 

  12. V. Diekert and G. Rozenberg, editors. Book of Traces. World Scientific, Singapore, to appear.

    Google Scholar 

  13. W. Fischer. Über erkennbare und rationale Mengen in freien partiell kommutativen Monoiden. Report FBI-HH-B-121/86, Fachbereich Informatik der Universität Hamburg, Hamburg, 1986. (Diplomarbeit 1985).

    Google Scholar 

  14. M. Jantzen. Confluent String Rewriting. EATCS Monographs on Theoretical Computer Science 14. Springer, Berlin-Heidelberg-New York, 1988.

    Google Scholar 

  15. R. Keller. Parallel program schemata and maximal parallelism I. Fundamental results. Journal of the Association of Computing Machinery, 20:514–537, 1973.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  18. A. Mazurkiewicz. Trace theory. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets, Applications and Relationship to other Models of Concurrency, Lecture Notes in Computer Science 255, pages 279–324. Springer, Berlin-Heidelberg-New York, 1987.

    Google Scholar 

  19. P. Narendran and F. Otto. Preperfectness is undecidable for Thue systems containing only length-reducing rules and a single commutation rule. Information Processing Letters, 29:125–130, 1988.

    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 & Volker Diekert

Authors
  1. Michael Bertol
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Volker Diekert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hubert Comon Jean-Pierre Jounnaud

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bertol, M., Diekert, V. (1995). On efficient reduction algorithms for some trace rewriting systems. In: Comon, H., Jounnaud, JP. (eds) Term Rewriting. TCS School 1993. Lecture Notes in Computer Science, vol 909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59340-3_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-59340-3_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59340-9

  • Online ISBN: 978-3-540-49237-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation