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 Contributor : Pierre RétyConnect in order to contact the contributor Submitted on : Friday, November 6, 2015 - 10:06:34 AM Last modification on : Saturday, June 25, 2022 - 10:12:45 AM