Skip to main content
SpringerLink
Log in

Confluence of one-rule Thue systems

  • Conference paper
  • First Online:
Word Equations and Related Topics (IWWERT 1990)

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

Included in the following conference series:

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

    Google Scholar 

  2. R. Book. Confluent and other types of Thue systems. J. Assoc. Comp. Mach., vol. 29 (1982), 171–182.

    Google Scholar 

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

    Google Scholar 

  4. R. Book. Homogeneous Thue systems and the Church-Rosser property. Discrete Mathematics, vol. 48 (1984), 137–145.

    Google Scholar 

  5. R. Book and C. O'Dúnlaing. Testing for the Church-Rosser property. Theoret. Comput. Sci., vol. 16 (1981), 223–229.

    Google Scholar 

  6. V. Diekert and C. Wrathall. On confluence of one-rule trace rewriting, in preparation.

    Google Scholar 

  7. Z. Galil and J. Seiferas. Time-space optimal string matching. J. Comput. Systems Sci., vol. 26 (1983), 280–294.

    Google Scholar 

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

    Google Scholar 

  9. M. Jantzen. Confluent String Rewriting, EATCS Monographs on Theoretical Computer Science 14, Springer-Verlag, 1988.

    Google Scholar 

  10. D. Kapur, M. Krishnamoorthy, R. McNaughton and P. Narendran. An O(¦T¦ 3) algorithm for testing the Church-Rosser property of Thue systems. Theoret. Comput. Sci., vol. 35 (1985), 109–114.

    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., vol. 35 (1985), 337–344.

    Google Scholar 

  12. D. Knuth, J. Morris and V. Pratt. Fast pattern matching in strings. SIAM J. Comput., vol. 6 (1977), 323–350.

    Google Scholar 

  13. W. Kurth. Termination und Confluenz von Semi-Thue-Systems mit nur einer Regel, Dissertation, Mathematische-Naturwissenschaftliche Fakultät, Technische Universität Clausthal, Chapter 6, 1990.

    Google Scholar 

  14. M. Lothaire. Combinatorics on Words, Addison-Wesley, Reading, Mass., 1983.

    Google Scholar 

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

    Google Scholar 

  16. C. Wrathall. Confluence of one-rule Thue systems. Tech. Report 24, Universität Würzburg, January, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    C. Wrathall

Authors
  1. C. Wrathall
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. U. Schulz

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wrathall, C. (1992). Confluence of one-rule Thue systems. In: Schulz, K.U. (eds) Word Equations and Related Topics. IWWERT 1990. Lecture Notes in Computer Science, vol 572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55124-7_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-55124-7_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46737-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation