Deterministic tree pushdown automata and monadic tree rewriting systems
Journal of Computer and System Sciences
Decision problems for term rewriting systems and recognizable tree languages
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Linear generalized semi-monadic rewrite systems effectively preserve recognizability
Theoretical Computer Science
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
RTA '00 Proceedings of the 11th 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
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
Bottom-Up Tree Pushdown Automata and Rewrite Systems
RTA '91 Proceedings of the 4th 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
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
Information Processing Letters
Bottom-up rewriting is inverse recognizability preserving
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
| 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 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.