Skip to main content
SpringerLink
Log in

It is decidable whether a monadic thue system is canonical over a regular set

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

A restricted confluence problem is investigated for string-rewriting systems (Thue systems). It is shown that it is decidable whether a monadic Thue system is canonical over a regular set; i.e., there is an algorithm to determine whether every string in a regular set has a unique normal form modulo a monadic Thue system.

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. Beeri, C., An Improvement on Valiant's Decision Procedure for Equivalence of Deterministic Finite Turn Pushdown Machines,Theoretical Computer Science,3 (1976), 305–320.

    Google Scholar 

  2. Benois, M., Parties Rationelle du Group Libre,Comptes Rendus des Séances de l'Académie des Sciences, Série A,269 (1969), 1188–1190.

    Google Scholar 

  3. Book, R. V., Thue Systems as Rewriting Systems,Journal of Symbolic Computation,3 (1987), 39–68.

    Google Scholar 

  4. Book, R. V., and Ó'Dúnlaing, C., Testing for the Church-Rosser Property,Theoretical Computer Science,16 (1981), 223–229.

    Google Scholar 

  5. Guttag, J. V., Kapur, D., and Musser, D. R., On Proving Uniform Termination and Restricted Termination of Rewriting Systems,SIAM Journal on Computing,12 (1983), 189–214.

    Google Scholar 

  6. Kapur, D., Narendran, P., and Otto, F., On Ground-Confluence of Term Rewriting Systems,Information and Computation,86 (1990), 14–31.

    Google Scholar 

  7. Nivat, M. (with M. Benois), Congruence Parfaites et Quasi-Parfaites, inSeminaire Dubreil, 25 e Année, 1971–72, 7-01-09.

  8. Otto, F., On Deciding the Confluence of a Finite String-Rewriting System on a Given Congruence Class,Journal of Computer and System Sciences,35 (1987), 285–310.

    Google Scholar 

  9. Senizergues, G., The Equivalence and Inclusion Problems for N.T.S. Languages,Journal of Computer and System Sciences,31 (1985), 303–331.

    Google Scholar 

  10. Valiant, L. G., The Equivalence Problem for Deterministic Finite Turn Pushdown Automata,Information and Control,25 (1974), 123–133.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Paliath Narendran

Authors
  1. Paliath Narendran
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by the Natural Sciences and Engineering Research Council of Canada. It was done while the author was visiting the Department of Computer Science, University of Calgary, Alberta, Canada T2N 1N4.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Narendran, P. It is decidable whether a monadic thue system is canonical over a regular set. Math. Systems Theory 23, 245–254 (1990). https://doi.org/10.1007/BF02090778

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation