Match-bounded string rewriting systems
type: Item
instance of: scholarly article
title: Match-bounded string rewriting systems
zbMATH Open document ID: 1101.68048
author: Alfons Geser
author: Dieter Hofbauer
author: Johannes Waldmann
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 2005-02-09T00:00:00Z
full work available at URL: http://hdl.handle.net/2060/20040046918
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 03B35
zbMATH DE Number: 2133266
zbMATH Keywords: string rewriting system
zbMATH Keywords: semi-Thue system
zbMATH Keywords: termination
zbMATH Keywords: match-bounded
MaRDI profile type: Publication
OpenAlex ID: W2137374798
cites work: Monadic Thue systems
cites work: Q4846257
cites work: Q4218931
cites work: Q3917482
cites work: Termination of rewriting
cites work: Q2723425
cites work: Mathematical Foundations of Computer Science 2003
cites work: Implementation and Application of Automata
cites work: Non-Looping String Rewriting
cites work: Mappings which preserve context sensitive languages
cites work: Context-Limited Grammars
cites work: Q4452074
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: Q5691608
cites work: Q4808744
cites work: Termination of term rewriting: Interpretation and type elimination
cites work: The termination hierarchy for term rewriting
cites work: A complete characterization of termination of \(0^p1^q\to 1^r0^s\)
DOI: 10.1007/S00200-004-0162-8
description: scientific article; zbMATH DE number 2133266