Decidability of confluence for ground term rewriting systems
- 25 January 2006
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Confluent and coherent equational term rewriting systems application to proofs in abstract data typesPublished by Springer Nature ,1983
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- Orderings for term-rewriting systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Sur l'inversion des morphismes d'arbresLecture Notes in Computer Science, 1978
- Complexity of finitely presented algebrasPublished by Association for Computing Machinery (ACM) ,1977
- Bottom-up and top-down tree transformations— a comparisonTheory of Computing Systems, 1975
- Compositions of n tree transducersPublished by Association for Computing Machinery (ACM) ,1972
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970
- Tree generating regular systemsInformation and Control, 1969