Unique Normalization for Shallow TRS

  • Guillem Godoy
  • Florent Jacquemard
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5595)

Abstract

Computation with a term rewrite system (TRS) consists in the application of its rules from a given starting term until a normal form is reached, which is considered the result of the computation. The unique normalization (UN) property for a TRS \(\mathcal{R}\) states that any starting term can reach at most one normal form when \(\mathcal{R}\) is used, i.e. that the computation with \(\mathcal{R}\) is unique.

We study the decidability of this property for classes of TRS defined by syntactic restrictions such as linearity (variables can occur only once in each side of the rules), flatness (sides of the rules have height at most one) and shallowness (variables occur at depth at most one in the rules).

We prove that UN is decidable in polynomial time for shallow and linear TRS, using tree automata techniques. This result is very near to the limits of decidability, since this property is known undecidable even for very restricted classes like right-ground TRS, flat TRS and also right-flat and linear TRS. We also show that UN is even undecidable for flat and right-linear TRS. The latter result is in contrast with the fact that many other natural properties like reachability, termination, confluence, weak normalization, etc. are decidable for this class of TRS.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, New York (1998)CrossRefMATHGoogle Scholar
  2. 2.
    Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), http://tata.gforge.inria.fr
  3. 3.
    Comon, H., Jacquemard, F.: Ground reducibility is EXPTIME-complete. Information and Computation 187(1), 123–153 (2003)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Godoy, G., Hernández, H.: Undecidable properties for flat term rewrite systems (submitted) (2008)Google Scholar
  5. 5.
    Godoy, G., Huntingford, E., Tiwari, A.: Termination of rewriting with right-flat rules. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 200–213. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  6. 6.
    Godoy, G., Tison, S.: On the normalization and unique normalization properties of term rewrite systems. In: Pfenning, F. (ed.) CADE 2007. LNCS, vol. 4603, pp. 247–262. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Godoy, G., Tiwari, A.: Deciding fundamental properties of right-(ground or variable) rewrite systems by rewrite closure. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 91–106. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Godoy, G., Tiwari, A.: Confluence of shallow right-linear rewrite systems. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 541–556. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Jacquemard, F.: Reachability and confluence are undecidable for flat term rewriting systems. Inf. Process. Lett. 87(5), 265–270 (2003)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Mitsuhashi, I., Oyamaguchi, M., Jacquemard, F.: The confluence problem for flat TRSs. In: Calmet, J., Ida, T., Wang, D. (eds.) AISC 2006. LNCS (LNAI), vol. 4120, pp. 68–81. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  11. 11.
    Nagaya, T., Toyama, Y.: Decidability for left-linear growing term rewriting systems. Inf. Comput. 178(2), 499–514 (2002)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Nieuwenhuis, R.: Basic paramodulation and decidable theories (extended abstract). In: LICS, pp. 473–482 (1996)Google Scholar
  13. 13.
    Salomaa, K.: Deterministic tree pushdown automata and monadic tree rewriting systems. J. Comput. Syst. Sci. 37, 367–394 (1998)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Sipser, M.: Introduction to the Theory of Computation. Course Technology (2006)Google Scholar
  15. 15.
    Takai, T., Kaji, Y., Seki, H.: Right-linear finite path overlapping term rewriting systems effectively preserve recognizability. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol. 1833, pp. 246–260. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  16. 16.
    Verma, R.: Complexity of normal form properties and reductions for rewriting problems. Fundamenta Informaticae (accepted for publication) (2008)Google Scholar
  17. 17.
    Verma, R.: New undecidability results for properies of term rewrite systems. In: 9th International workshop, RULE, pp. 1–16 (2008)Google Scholar
  18. 18.
    Verma, R., Hayrapetyan, A.: A new decidability technique for ground term rewriting systems. ACM Trans. Comput. Log. 6(1), 102–123 (2005)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Verma, R., Zinn, J.: A polynomial-time algorithm for uniqueness of normal forms of linear shallow term rewrite systems. In: Symposium on Logic in Computer Science LICS (short presentation) (2006)Google Scholar
  20. 20.
    Wang, Y., Sakai, M.: Decidability of termination for semi-constructor trss, left-linear shallow TRSs and related systems. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 343–356. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Guillem Godoy
    • 1
  • Florent Jacquemard
    • 2
  1. 1.Technical University of CataloniaBarcelonaSpain
  2. 2.INRIA Saclay & LSV (UMR CNRS/ENS Cachan)France

Personalised recommendations