Decidability of confluence and termination of monadic term rewriting systems
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Handbook of theoretical computer science (vol. B)
Bottom-up tree pushdown automata: classification and connection with rewrite systems
Theoretical Computer Science
Handbook of formal languages, vol. 3
Linear generalized semi-monadic rewrite systems effectively preserve recognizability
Theoretical Computer Science
Term rewriting and all that
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Proving termination with multiset orderings
Communications of the ACM
Termination of Linear Rewriting Systems (Preliminary Version)
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Transforming Termination by Self-Labelling
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Termination Of Term Rewriting By Semantic Labelling
Fundamenta Informaticae
Information Processing Letters
| Hi-index | 5.23 |
We show that termination and convergence are decidable properties for right-linear half-monadic term rewrite systems.