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
Automata for reduction properties solving
Journal of Symbolic Computation
Proceedings of the 9th International Conference on Rewriting Techniques and Applications
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
The Recognizability Problem for Tree Automata with Comparisons between Brothers
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Normalization of S-Terms is Decidable
RTA '98 Proceedings of the 9th 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
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
In this paper we study applications of relations based on rewrite systems to regular tree languages. For instance, we want to deal with decidability problems of the form "Rel(L1) ⊆ L2" where L1; L2 are regular tree languages and Rel can be either IO, OI, parallel, or one step rewriting for a given rewrite system. Our method somehow standardizes previous ones because it reveals conditions Rel must fulfill to preserve recognizability for the language Rel(L1). Thanks to classes of recognizable languages wider than the regular one, we get some new results. We pursue this method to tackle the problem of computing the set of descendants of a regular tree language by a rewrite system.