Simple termination is difficult
type: Item
instance of: scholarly article
title: Simple termination is difficult
zbMATH Open document ID: 0815.68064
DOI: 10.1007/BF01225647
author: Aart Middeldorp
author: Bernhard Gramlich
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 1995-01-31T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 716270
zbMATH Keywords: simplification orders
zbMATH Keywords: terminating term rewriting system
zbMATH Keywords: undecidability
MaRDI profile type: Publication
cites work: Q2736359
cites work: Simulation of Turing machines by a regular rewrite rule
cites work: Termination of rewriting
cites work: Q4385532
cites work: Generalized sufficient conditions for modular termination of rewriting
cites work: The undecidability of the Turing machine immortality problem
cites work: Q3327710
cites work: Modularity of simple termination of term rewriting systems with shared constructors
cites work: Q3998014
cites work: The undecidability of self-embedding for term rewriting systems
cites work: Q3774933
description: scientific article; zbMATH DE number 716270