Abstract : For any left-linear context-sensitive term rewrite system and any regular language of ground terms I, we build a finite tree automaton that recognizes a superset of the descendants of I, i.e. of the terms reachable from I by context-sensitive rewriting.
https://hal.inria.fr/hal-01225332
Contributeur : Pierre Réty
<>
Soumis le : vendredi 6 novembre 2015 - 10:06:34
Dernière modification le : jeudi 17 janvier 2019 - 15:06:06
