Deterministic tree pushdown automata and monadic tree rewriting systems
Journal of Computer and System Sciences
Bottom-up tree pushdown automata: classification and connection with rewrite systems
Theoretical Computer Science
Linear generalized semi-monadic rewrite systems effectively preserve recognizability
Theoretical Computer Science
Some undecidability results concerning the property of preserving regularity
Theoretical Computer Science - Special issue In Memoriam of Ronald V. Book
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 Sets of Descendants and Sets of Normal Forms
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Rewriting for Cryptographic Protocol Verification
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Reachability Analysis over Term Rewriting Systems
Journal of Automated Reasoning
Tree automata for rewrite strategies
Journal of Symbolic Computation
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
Information Processing Letters
| Hi-index | 0.89 |
For a tree language L and a set S of term rewrite rules over Σ, the descendant of L for S is the set S* (L) of trees reachable from a tree in L by rewriting in S. For a recognizable tree language L, we study the set D(L) of descendants of L for all sets of linear monadic term rewrite rules over Σ. We show that D(L) is finite. For each tree automaton A over Σ, we can effectively construct a set {R1,...,Rk} of linear monadic term rewrite systems over Σ such that D(L(A)) = {R1*(L(A)),...,RK*(L(A))} and for any 1 ≤ i j ≤ k, Ri*(L(A)) ≠ Rj*(L(A)).