P. Rety. Regular Sets of Descendants for Constructor-based Rewrite Systems. In Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning, Tbilisi (Georgia), volume 1705 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1999. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Timbuk - A Tree Automata Library - Genet, al. (2003) (Correct)
No context found.
P. Rety. Regular Sets of Descendants for Constructor-based Rewrite Systems. In Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning, Tbilisi (Georgia), volume 1705 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC