Author:
Creus Carles,Godoy Guillem,Massanes Francesc,Tiwari Ashish
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference14 articles.
1. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
2. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications. Available on: www.grappa.univ-lille3.fr/tata (2007). Accessed 12 Oct 2007
3. Comon, H., Jacquemard, F.: Ground reducibility is EXPTIME-complete. Inf. Comput. 187(1), 123–153 (2003)
4. Creus, C., Godoy, G., Massanes, F., Tiwari, A.: Non-linear rewrite closure and weak normalization. In: LICS, pp. 365–374 (2009)
5. Dauchet, M., Caron, A.C., Coquidé, J.L.: Automata for reduction properties solving. J. Symb. Comput. 20(2), 215–233 (1995)