Termination of string rewriting proved automatically
type: Item
instance of: scholarly article
title: Termination of string rewriting proved automatically
zbMATH Open document ID: 1102.68649
published in: Journal of Automated Reasoning
publication date: 2006-11-03T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 5070709
zbMATH Keywords: string rewriting
zbMATH Keywords: termination
zbMATH Keywords: semantic labelling
zbMATH Keywords: relative termination
zbMATH Keywords: match-bounds
author: Hans Zantema
describes a project that uses: REVE
describes a project that uses: AProVE
describes a project that uses: CiME
describes a project that uses: Tsukuba
describes a project that uses: Matchbox
describes a project that uses: TORPA
MaRDI profile type: Publication
full work available at URL: s10817-005-6545-0
OpenAlex ID: W1970844917
cites work: Termination of term rewriting using dependency pairs
cites work: Termination of rewriting systems by polynomial interpretations and its implementation
cites work: Q3917482
cites work: Orderings for term-rewriting systems
cites work: Mathematical Foundations of Computer Science 2003
cites work: Match-bounded string rewriting systems
cites work: Implementation and Application of Automata
cites work: Q4447242
cites work: Q4447241
cites work: Rewriting Techniques and Applications
cites work: On recursive path ordering
cites work: Q3998014
cites work: The 3x + 1 Problem and Its Generalizations
cites work: Q4000296
cites work: Termination of term rewriting: Interpretation and type elimination
cites work: Q4847000
cites work: Non-Looping String Rewriting
DOI: 10.1007/S10817-005-6545-0
description: scientific article; zbMATH DE number 5070709