Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming
- 31 December 1990
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 75 (1-2), 157-215
- https://doi.org/10.1016/0304-3975(90)90066-q
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Termination of rewritingJournal of Symbolic Computation, 1987
- Equivalences and transformations of regular systems—Applications to recursive program schemes and grammarsTheoretical Computer Science, 1986
- Properties of substitutions and unificationsJournal of Symbolic Computation, 1985
- TerminationLecture Notes in Computer Science, 1985
- Fundamental properties of infinite treesTheoretical Computer Science, 1983
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Flow diagrams, turing machines and languages with only two formation rulesCommunications of the ACM, 1966