Termination proofs for string rewriting systems via inverse match-bounds
type: Item
instance of: scholarly article
title: Termination proofs for string rewriting systems via inverse match-bounds
zbMATH Open document ID: 1105.68054
author: Alfons Geser
author: Dieter Hofbauer
author: Johannes Waldmann
published in: Journal of Automated Reasoning
publication date: 2006-11-17T00:00:00Z
full work available at URL: http://hdl.handle.net/2060/20040086792
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5073793
describes a project that uses: Matchbox
MaRDI profile type: Publication
OpenAlex ID: W2093130576
cites work: Q3859267
cites work: Q4846257
cites work: Q4218931
cites work: Termination of rewriting
cites work: On normalizing, non-terminating one-rule string rewriting systems
cites work: Q4447248
cites work: Mathematical Foundations of Computer Science 2003
cites work: Match-bounded string rewriting systems
cites work: FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS
cites work: Mappings which preserve context sensitive languages
cites work: Context-Limited Grammars
cites work: Deleting string rewriting systems preserve regularity
cites work: Termination and derivational complexity of confluent one-rule string-rewriting systems
cites work: Q3998014
cites work: Semi-Thue systems with an inhibitor
cites work: Q4407712
cites work: Q5691608
cites work: A complete characterization of termination of \(0^p1^q\to 1^r0^s\)
DOI: 10.1007/S10817-005-9024-8
description: scientific article; zbMATH DE number 5073793