Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10325558 | Journal of Symbolic Computation | 2005 | 46 Pages |
Abstract
For a constructor-based rewrite system R, a regular set of ground terms E, and assuming some additional restrictions, we build finite tree automata that recognize the descendants of E, i.e. the terms issued from E by rewriting, according to innermost, outermost, leftmost, and innermost-leftmost strategies.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Pierre Réty, Julie Vuotto,