Author:
Godoy Guillem,Huntingford Eduard
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), Available on
http://www.grappa.univ-lille3.fr/tata
2. Coquidé, J.L., Dauchet, M., Gilleron, R., Vágvölgyi, S.: Bottom-up tree pushdown automata: classification and connection with rewrite systems. Theoretical Computer Science 127, 69–98 (1994)
3. Dershowitz, N., Jouannaud, J.P.: Rewrite systems. In: van Leeuwen, J.(ed.) Handbook of Theoretical Computer Science (Vol. B: Formal Models and Semantics), pp. 243–320, Amsterdam, North-Holland (1990)
4. Ganzinger, H., Jacquemard, F., Veanes, M.: Rigid reachability: The non-symmetric form of rigid E-unification. Intl. Journal of Foundations of Computer Science 11(1), 3–27 (2000)
5. Lecture Notes in Artificial Intelligence;G. Godoy,2004
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献