Skip to main content
Springer Nature Link
Log in

Decidability for Left-Linear Growing Term Rewriting Systems

  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1999)

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

Included in the following conference series:

  • 250 Accesses

Abstract

A term rewriting system is called growing if each variable occurring both the left-hand side and the right-hand side of a rewrite rule occurs at depth zero or one in the left-hand side. Jacquemard showed that the reachability and the sequentiality of linear (i.e., left-right-linear) growing term rewriting systems are decidable. In this paper we show that Jacquemard’s result can be extended to left-linear growing rewriting systems that may have right-non-linear rewrite rules. This implies that the reachability and the joinability of some class of right-linear term rewriting systems are decidable, which improves the results for rightground term rewriting systems by Oyamaguchi. Our result extends the class of left-linear term rewriting systems having a decidable call-by-need normalizing strategy. Moreover, we prove that the termination property is decidable for almost orthogonal growing term rewriting systems.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. F. Baader and T. Nipkow, Term Rewriting and All That, Cambridge University Press, 1998.

    Google Scholar 

  2. H. Comon, Sequentiality, Second Order Monadic Logic and Tree Automata, Proceedings of the 10th IEEE Symposium on Logic in Computer Science, San Diego, pp.508–517, 1995.

    Google Scholar 

  3. H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi, Tree Automata Techniques and Applications, Preliminary Version.

    Google Scholar 

  4. J.-L. Coquidé, M. Dauchet, R. Gilleron, and S. Vágvölgyi, Bottom-Up Tree Pushdown Automata: Classiffication and Connection with Rewrite Systems, Theoretical Computer Science 127, pp.69–98, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  5. N. Dershowitz, Termination of Linear Rewriting Systems, LNCS 115, pp.448–458, 1981.

    Google Scholar 

  6. N. Dershowitz and J.-P. Jouannaud, Rewrite Systems, in Handbook of Theoretical Computer Science, Vol.B, ed. J. van Leeuwen, North-Holland, pp.243–320, 1990.

    Google Scholar 

  7. I. Durand and A. Middeldorp, Decidable Call by Need Computations in Term Rewriting (Extended Abstract), LNAI 1249, pp.4–18,1997.

    MathSciNet  Google Scholar 

  8. F. Gécseg and M. Steinby, Tree Automata, Akadémiai Kiadó, Budapest, 1984.

    MATH  Google Scholar 

  9. T. Genet, Decidable Approximations of Sets of Descendants and Sets of Normal Forms, LNCS 1379, pp.151–165, 1998.

    MathSciNet  Google Scholar 

  10. R. Gilleron and S. Tison, Regular Tree Languages and Rewrite Systems, Fundamenta Informaticae 24, pp.157–176, 1995.

    MATH  MathSciNet  Google Scholar 

  11. B. Gramlich, Abstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems, Fundamenta Informaticae 24, pp.3–23, 1995.

    MATH  MathSciNet  Google Scholar 

  12. G. Huet and D. Lankford, On the Uniform Halting Problem for Term Rewriting Systems, INRIA Technical Report 283, 1978.

    Google Scholar 

  13. G. Huet and J.-J. Lévy, Computations in Orthogonal Rewriting Systems, I and II, in Computational Logic, Essays in Honor of Alan Robinson, eds. J.-L. Lassez and G. Plotkin, MIT Press, pp.396–443, 1991.

    Google Scholar 

  14. F. Jacquemard, Decidable Approximations of Term Rewriting Systems, LNCS 1103, pp.362–376, 1996.

    MathSciNet  Google Scholar 

  15. K. Kitaoka, T. Takai, Y. Kaji, T. Tanaka, H. Seki, Finite Overlapping Term Rewriting Systems Eéctively Preserve Recognizablility, IEICE Technical Report COMP98-45, Vol.98, No.380, pp.57–64, 1998 (in Japanese).

    Google Scholar 

  16. J.W. Klop, Term Rewriting Systems, in Handbook of Logic in Computer Science, Vol.2, eds. S. Abramasky, D. Gabbay, and T. Maibaum, pp.1–116, Oxford University Press, 1992.

    Google Scholar 

  17. M. Oyamaguchi, The Reachability and Joinability Problems for Right-Ground Term-Rewriting Systems, Journal of Information Processing 13, pp.347–354, 1990.

    MathSciNet  Google Scholar 

  18. K. Salomaa, Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems, J. Comput. and Syst. Sci. 37, pp.367–394, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  19. K. Salomaa, Decidability of Confluence and Termination of Monadic Term Rewriting Systems, LNCS 488, pp.275–286, 1991.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science, JAIST, Tatsunokuchi, Ishikawa, 923-1292, Japan

    Takashi Nagaya & Yoshihito Toyama

Authors
  1. Takashi Nagaya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yoshihito Toyama
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University at Albany — SUNY, Albany, NY, 12222, USA

    Paliath Narendran

  2. LORIA — INRIA Lorraine 615, rue du Jardin Botanique, F-54602, Villers les Nancy, Cedex, France

    Michael Rusinowitch

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nagaya, T., Toyama, Y. (1999). Decidability for Left-Linear Growing Term Rewriting Systems. In: Narendran, P., Rusinowitch, M. (eds) Rewriting Techniques and Applications. RTA 1999. Lecture Notes in Computer Science, vol 1631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48685-2_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-48685-2_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66201-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics