Regular Sets of Descendants by Leftmost Strategy |
| |
Authors: | Pierre Rty Julie Vuotto |
| |
Affiliation: | aLIFO, Université d'Orléans, B.P. 6759, 45067, Orléans cedex 2, France |
| |
Abstract: | For a constructor-based rewrite system R, a regular set of ground terms E, and assuming some additional restrictions, we build a finite tree automaton that recognizes the descendants of E, i.e. the terms issued from E by rewriting, according to leftmost strategy. |
| |
Keywords: | term rewriting strategy tree automaton |
本文献已被 ScienceDirect 等数据库收录! |
|