Deterministic tree pushdown automata and monadic tree rewriting systems
Journal of Computer and System Sciences
Bottom-up tree pushdown automata and rewrite systems
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Automata for reduction properties solving
Journal of Symbolic Computation
Unification of infinite sets of terms schematized by primal grammars
Theoretical Computer Science
Regular Sets of Descendants for Constructor-Based Rewrite Systems
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Synchronized Tree Languages Revisited and New Applications
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Decidable Approximations of Term Rewriting Systems
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Decidable Approximations of Sets of Descendants and Sets of Normal Forms
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Sequentiality, Second-order Monadic Logic and Tree Automata
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Reachability Analysis over Term Rewriting Systems
Journal of Automated Reasoning
Approximation-based tree regular model-checking
Nordic Journal of Computing
Tree automata for rewrite strategies
Journal of Symbolic Computation
| Hi-index | 0.00 |
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 innermost, innermost-leftmost, and outermost strategies.