Over-Approximating Terms Reachable by Context-Sensitive Rewriting
Nirina Andrianarivelo, Nirina Andrianarivelo · 2015
Abstract. For any left-linear context-sensitive term rewrite system and any regular language of ground terms I, we build a finite tree automa-ton that recognizes a superset of the descendants of I, i.e. of the terms reachable from I by context-sensitive rewriting. 1