Skip to main content
SpringerLink
Log in

A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems

  • Original Paper
  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

Term rewrite systems are useful in many areas of computer science. Two especially important areas are decision procedures for the word problem of some algebraic systems and rule-based programming. One of the most studied properties of rewrite systems is confluence, and one of the primary benefits of having a confluent rewrite system is that the system also has uniqueness of normal forms. However, uniqueness of normal forms is an interesting property in its own right and well studied. Also, confluence can be too strong a requirement for some applications. In this paper, we study the decidability of uniqueness of normal forms. Uniqueness of normal forms is decidable for ground rewrite systems, but is undecidable in general. This paper shows that the uniqueness of normal forms problem is decidable for the class of linear shallow term rewrite systems, and gives a decision procedure that is polynomial as long as the arities of the function symbols are bounded or the signature is fixed.

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. Comon H.: Sequentiality, monadic second-order logic and tree automata. Inform. Comput. 157(1–2), 25–51 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2005). Available online at http://www.grappa.univ-lille3.fr/tata/

  3. Godoy, G., Jacquemard, F.: Unique normalization for shallow TRS. In: Treinen, R. (ed.) Proceedings of the 20th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 5595, pp. 63–77 (2009)

  4. Godoy G., Nieuwenhuis R., Tiwari A.: Classes of term rewrite systems with polynomial confluence problems. ACM Trans. Comput. Logic 5(2), 321–331 (2004)

    Article  MathSciNet  Google Scholar 

  5. Godoy, G., Tiwari, A.: Termination of rewrite systems with shallow right-linear, collapsing, and right-ground rules. In: Nieuwenhuis, R. (ed.) Proceedings of the 20th International Conference on Automated Deduction 2005, Lecture Notes in Computer Science, vol. 3632, pp. 164–176. Springer (2005)

  6. Godoy G., Tiwari A., Verma R.: Deciding confluence of certain term rewriting systems in polynomial time. Ann. Pure Appl. Logic 130(1–3), 33–59 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Nieuwenhuis R.: Decidability and complexity analysis by basic paramodulation. Inform. Comput. 147, 1–21 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  8. Terese: Term Rewriting Systems. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  9. Verma, R.: New undecidability results for problems of term rewriting systems. In: Proceedings of the 9th International Workshop on Rule-based Programming (2008)

  10. Verma R.: Complexity of normal form properties and reductions for term rewriting problems. Fundamenta Informaticae 92(1-2), 145–168 (2009)

    MATH  MathSciNet  Google Scholar 

  11. Verma R., Rusinowitch M., Lugiez D.: Algorithms and reductions for rewriting problems. Fundamenta Informaticae 46(3), 257–276 (2001)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Houston, Houston, TX, 77204, USA

    Julian Zinn & Rakesh M. Verma

Authors
  1. Julian Zinn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rakesh M. Verma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rakesh M. Verma.

Additional information

Research supported in part by NSF grants CCF 0306475, DUE 0755500 and DUE 0737404.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zinn, J., M. Verma, R. A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems. AAECC 21, 459–485 (2010). https://doi.org/10.1007/s00200-010-0133-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-010-0133-1

Keywords

Search

Navigation