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
Handbook of theoretical computer science (vol. B)
E-Unification by Means of Tree Tuple Synchronized Grammars
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
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
Ground Reducibility is EXPTIME-complete
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
Reachability Analysis of Term Rewriting Systems with Timbuk
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Weakly Regular Relations and Applications
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Regular Sets of Descendants by Some Rewrite Strategies
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Certifying a Tree Automata Completion Checker
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Solving first order formulae of pseudo-regular theory
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
Starting from the reguletr tree language E of ground constructor-instances of any linear term, we build a finite tree automaton that recognizes the set of descendants R* (E) of E for a constructor-based term rewrite system whose right-hand-sides fulfill the following three restrictions: linearity, no nested function symbols, function arguments are variables or ground terms. Note that left-linearity is not assumed. We next present severed applications.