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
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
Term rewriting and all that
Regular Sets of Descendants for Constructor-Based Rewrite Systems
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Decidability for Left-Linaer Growing Term Rewriting Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
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
Approximating Dependency Graphs Using Tree Automata Techniques
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Decidable Call by Need Computations in term Rewriting (Extended Abstract)
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
Decidability and Closure Properties of Equational Tree Languages
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Reachability Analysis over Term Rewriting Systems
Journal of Automated Reasoning
Decidable call-by-need computations in term rewriting
Information and Computation
Theoretical Computer Science
Closure of Hedge-Automata Languages by Hedge Rewriting
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Decidable call-by-need computations in term rewriting
Information and Computation
Tree automata for rewrite strategies
Journal of Symbolic Computation
Bottom-up rewriting is inverse recognizability preserving
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Tree automata with equality constraints modulo equational theories
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
| Hi-index | 0.00 |
A term rewriting system which effectively preserves recognizability (EPR-TRS) has good mathematical properties. In this paper, a new subclass of TRSs, layered transducing TRSs (LT-TRSs) is defined and its recognizability preserving property is discussed. The class of LT-TRSs contains some EPR-TRSs, e.g., {f(x) 驴 f(g(x))} which do not belong to any of the known decidable subclasses of EPR-TRSs. Bottom-up linear tree transducer, which is a well-known computation model in the tree language theory, is a special case of LT-TRS. We present a sufficient condition for an LT-TRS to be an EPR-TRS. Also some properties of LT-TRSs including reachability are shown to be decidable.