Regular Sets of Descendants for Constructor-Based Rewrite Systems
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Regular Sets of Descendants by Some Rewrite Strategies
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Reachability Analysis over Term Rewriting Systems
Journal of Automated Reasoning
Handling Left-Quadratic Rules When Completing Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
| Hi-index | 0.00 |