Over-Approximating Terms Reachable by Context-Sensitive Rewriting

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.

• Type: Journal
• Year: 2015
• Where: RP
• Authors: Nirina Andrianarivelo, Pierre Réty
• Keywords: Control Systems, RP 2015