Undecidable properties of flat term rewrite systems

Article

Abstract

Reachability, joinability and confluence properties are known to be undecidable for flat term rewrite systems (TRS). We give shorter and conceptually simpler proofs of these results. We also prove undecidability of weak normalization and unique normalization properties for flat TRS.

Keywords

Term rewriting Syntactic restrictions Undecidability 

Mathematics Subject Classification (2000)

16S15 68Q42 

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)Google Scholar
  2. 2.
    Godoy, G., Huntingford, E., Tiwari, A.: Termination of rewriting with right-flat rules. In: Baader, F. (ed.) Term Rewriting and Applications, 18th International Conference, RTA, LNCS, vol. 4533, pp. 200–213. Springer, Heidelberg (2007)Google Scholar
  3. 3.
    Godoy, G., Tison, S.: On the normalization and unique normalization properties of term rewrite systems. In: Pfenning, F. (ed.) Proceedings of the 21st International Conference on Automated Deduction (CADE-21), LNCS, vol. 4603, pp. 247–262 (2007)Google Scholar
  4. 4.
    Godoy, G., Tiwari, A.: Deciding fundamental properties of right-(ground or variable) rewrite systems by rewrite closure. In: Basin, D., Rusinowitch, M. (eds.) International Joint Conference on Automated Deduction, IJCAR, LNAI, vol. 3097, pp. 91–106. Springer, Heidelberg (2004)Google Scholar
  5. 5.
    Godoy, G., Tiwari, A.: Confluence of shallow right-linear rewrite systems. In: Ong, C.H.L. (ed.) 19th International Workshop of Computer Science Logic, CSL, LNCS, vol. 3634, pp. 541–556. Springer, Heidelberg (2005)Google Scholar
  6. 6.
    Godoy, G., Tiwari, A., Verma, R.: On the confluence of linear shallow term rewrite systems. In: Alt, H., Habib, M. (eds.) 20th International Symposium on Theoretical Aspects of Computer Science STACS 2003, Lecture Notes in Computer Science, vol. 2607, pp. 85–96. Springer, Heidelberg (2003)Google Scholar
  7. 7.
    Jacquemard F.: Reachability and confluence are undecidable for flat term rewriting systems. Inf. Process. Lett. 87(5), 265–270 (2003)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Mitsuhashi, I., Oyamaguchi, M., Jacquemard, F.: The confluence problem for flat TRSs. In: Proceedings of 8th International Conference on Artificial Intelligence and Symbolic Computation (AISC’06), LNAI, vol. 4120, pp. 68–81. Springer, Heidelberg (2006)Google Scholar
  9. 9.
    Nagaya T., Toyama Y.: Decidability for left-linear growing term rewriting systems. Inf. Comput. 178(2), 499–514 (2002)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Sipser, M.: Introduction to the Theory of Computation. Course Technology (2006)Google Scholar
  11. 11.
    Takai, T., Kaji, Y., Seki, H.: Right-linear finite path overlapping term rewriting systems effectively preserve recognizability. In: Rewriting Techniques and Applications, RTA, LNCS, vol. 1833, pp. 246–260 (2000)Google Scholar
  12. 12.
    Verma R., Hayrapetyan A.: A new decidability technique for ground term rewriting systems. ACM Trans. Comput. Log. 6(1), 102–123 (2005)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Wang, Y., Sakai, M.: Decidability of termination for semi-constructor trss, left-linear shallow trss and related systems. In: Proceedings of the 17th International Conference of RTA, LNCS, vol. 4098, pp. 343–356. Springer, Heidelberg (2006)Google Scholar

Copyright information

© Springer-Verlag 2009

Authors and Affiliations

  1. 1.Universitat Politèctina de CatalunyaBarcelonaSpain

Personalised recommendations