Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1992: Mathematical Foundations of Computer Science 1992 pp 511–521Cite as

One-rule trace-rewriting systems and confluence

  • Conference paper
  • First Online:

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

Abstract

Confluence is an undecidable property even for finite noetherian trace-rewriting systems. Here we investigate this property for the special case of trace-rewriting systems with a single rule. For certain classes of one-rule trace-rewriting systems R we present syntactic characterizations that are necessary and sufficient for R to be confluent. Based on these characterizations confluence is easily decidable for these systems. In fact, each system satisfying one of these characterizations is strongly confluent. This raises the question of whether every confluent onerule trace-rewriting system is strongly confluent. We close this paper with an example that answers this question in the negative.

The work of this author was supported by the EBRA Working Group No. 3166 ASMICS.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Cori, D. Perrin: Automates et commutations partielles. RAIRO Inform. Theor. Appl. 19, 21–32 (1985)

    MATH  MathSciNet  Google Scholar 

  2. M. Dauchet: Termination of rewriting is undecidable in the one-rule case. In: M.P. Chytil, L. Janiga, V. Koubek (eds.): Mathematical Foundations of Computer Science 1988. Proceedings. Lecture Notes in Computer Science 324, pp. 262–268. Berlin: Springer 1988

    Chapter  Google Scholar 

  3. N. Dershowitz, J.P. Jouannaud: Rewrite systems. In: Handbook of Theoretical Computer Science, Vol. B, pp. 243–320. Amsterdam: Elsevier 1990

    Google Scholar 

  4. V. Diekert: On the Knuth-Bendix completion for concurrent processes. In: Th. Ottmann (ed.): Automata, Languages and Programming. Proceedings. Lecture Notes in Computer Science 267, pp. 42–53. Berlin: Springer 1987. Also in Theor. Compt. Science 66, 117–136 (1989)

    Google Scholar 

  5. V. Diekert: Combinatorics on Traces. Lecture Notes in Computer Science 454. Berlin: Springer 1990

    Google Scholar 

  6. C. Duboc: On some equations in free partially commutative monoids. Theor. Comput. Science 46, 159–174 (1986)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  8. J.P. Jouannaud, H. Kirchner: Completion of a set of rules modulo a set of equations. SIAM Journal on Computing 15, 1155–1194 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  9. W. Kurth: Termination und Konfluenz von Semi-Thue Systemen mit nur einer Regel. Dissertation. Clausthal: Math.-Naturwissenschaftl. Fakultät, Technische Universität 1990

    Google Scholar 

  10. M. Lothaire: Combinatorics on Words. Reading, M.A.: Addison-Wesley 1983

    Google Scholar 

  11. A. Mazurkiewicz: Traces, histories and graphs: Instances of a process monoid. In: M. Chytil, V. Koubek (eds.): Mathematical Foundations of Computer Science 1984. Proceedings. Lecture Notes in Computer Science 176, pp. 115–133. Berlin: Springer 1984

    Chapter  Google Scholar 

  12. P. Narendran, 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)

    Article  MATH  MathSciNet  Google Scholar 

  13. F. Otto: On deciding confluence of finite string-rewriting systems modulo partial commutativity. Theoretical Computer Science 67, 19–35 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  14. F. Otto, C. Wralhall: Characterizations of overlaps in free partially commutative monoids. Interner Bericht No. 184/88. Kaiserslautern: Fachbereich Informatik, Universität 1988

    Google Scholar 

  15. F. Otto, C. Wrathall: Overlaps in free partially commutative monoids. Journal Computer System Sciences 42, 186–198 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  16. C. Wrathall: Confluence of one-rule Thue systems. In: K.U. Schulz (ed.): Word Equations and Related Topics. Lecture Notes in Computer Science 572, pp. 237–246. Berlin: Springer 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of California, 93106, Santa Barbara, CA, USA

    C. Wrathall

  2. Institut für Informatik, Universität Stuttgart, Breilwiesenstr. 20-22, D-7000, Stuttgart 80

    V. Diekert

  3. Fachbereich Mathematik/Informatik, Gesamthochschule Kassel, Heinrich-Plett-Str. 40, D-3500, Kassel

    F. Otto

Authors
  1. C. Wrathall
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Diekert
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. F. Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ivan M. Havel Václav Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wrathall, C., Diekert, V., Otto, F. (1992). One-rule trace-rewriting systems and confluence. In: Havel, I.M., Koubek, V. (eds) Mathematical Foundations of Computer Science 1992. MFCS 1992. Lecture Notes in Computer Science, vol 629. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-55808-X_50

Download citation

  • DOI: https://doi.org/10.1007/3-540-55808-X_50

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55808-8

  • Online ISBN: 978-3-540-47291-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation