Deterministic tree pushdown automata and monadic tree rewriting systems
Journal of Computer and System Sciences
The reachability and joinability problems for right-ground term-rewriting systems
Journal of Information Processing
Handbook of theoretical computer science (vol. B)
Handbook of logic in computer science (vol. 2)
Bottom-up tree pushdown automata: classification and connection with rewrite systems
Theoretical Computer Science
Term rewriting and all that
Termination of Linear Rewriting Systems (Preliminary Version)
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Decidability of Confluence and Termination of Monadic Term Rewriting Systems
RTA '91 Proceedings of the 4th 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
Decidable Call by Need Computations in term Rewriting (Extended Abstract)
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Sequentiality, Second-order Monadic Logic and Tree Automata
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
Fundamenta Informaticae
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Autowrite: A Tool for Checking Properties of Term Rewriting Systems
RTA '02 Proceedings of the 13th 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
Visibly Pushdown Languages and Term Rewriting
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Closure of Hedge-Automata Languages by Hedge Rewriting
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Decidability of termination for semi-constructor TRSs, left-linear shallow TRSs and related systems
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
The confluence problem for flat TRSs
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
| Hi-index | 0.00 |
A. term rewriting system is called growing if each variable occurring both the left-hand side and the right-hand side of a rewrite rule occurs at depth zero or one in the left-hand side. Jacquemard showed that the reachability and the sequentiality of linear (i.e., left-right-linear) growing term rewriting systems are decidable. In this paper we show that Jacquemard's result can be extended to left-linear growing rewriting systems that may have right-non-linear rewrite rules. This implies that the reachability and the joinability of some class of right-linear term rewriting systems are decidable, which improves the results for rightground term rewriting systems by Oyamaguchi. Our result extends the class of left-linear term rewriting systems having a decidable call-by-need normalizing strategy. Moreover, we prove that the termination property is decidable for almost orthogonal growing term rewriting systems.