Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming
type: Item
instance of: scholarly article
title: Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming
zbMATH Open document ID: 0702.68036
DOI: 10.1016/0304-3975(90)90066-Q
author: Philippe Devienne
published in: Theoretical Computer Science
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68T99
zbMATH DE Number: 4151805
zbMATH Keywords: halting problem
zbMATH Keywords: complexity problems
zbMATH Keywords: logic programs
zbMATH Keywords: structured logic programming
MaRDI profile type: Publication
cites work: Flow diagrams, turing machines and languages with only two formation rules
cites work: Fundamental properties of infinite trees
cites work: Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
cites work: Simulation of Turing machines by a regular rewrite rule
cites work: Q3703288
cites work: Termination of rewriting
cites work: Q3742749
cites work: Properties of substitutions and unifications
cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
cites work: Q4195948
cites work: Q3339245
description: scientific article; zbMATH DE number 4151805