Sciweavers

Share
RP
2015
Springer

Over-Approximating Terms Reachable by Context-Sensitive Rewriting

3 years 1 months ago
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.
Nirina Andrianarivelo, Pierre Réty
Added 17 Apr 2016
Updated 17 Apr 2016
Type Journal
Year 2015
Where RP
Authors Nirina Andrianarivelo, Pierre Réty
Comments (0)
books