A complete characterization of termination of 0p 1q→1r 0s
From MaRDI portal
Publication:5055817
DOI10.1007/3-540-59200-8_46zbMath1503.68170OpenAlexW2114974231MaRDI QIDQ5055817
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59200-8_46
terminationterm rewritingstring rewritingderivation lengthsimple terminationtransformation orderingdummy elimination
Related Items
On termination of confluent one-rule string-rewriting systems, Dummy elimination in equational rewriting, On the termination problem for one-rule semi-Thue system, Dummy elimination: Making termination easier, Termination modulo equations by abstract commutation with an application to iteration, Termination and derivational complexity of confluent one-rule string-rewriting systems
Cites Work
- Orderings for term-rewriting systems
- Termination by completion
- Corrigendum to ``Termination of rewriting
- Termination of term rewriting: Interpretation and type elimination
- Simulation of Turing machines by a left-linear rewrite rule
- Topics in termination
- Dummy elimination: Making termination easier
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
