Rewriting systems and word problems in a free partially commutative monoid
type: Item
instance of: scholarly article
title: Rewriting systems and word problems in a free partially commutative monoid
zbMATH Open document ID: 0643.68101
DOI: 10.1016/0020-0190(87)90032-9
author: Ronald V. Book
author: Hai-Ning Liu
published in: Information Processing Letters
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 20M05
Mathematics Subject Classification ID: 03D03
Mathematics Subject Classification ID: 20M35
zbMATH DE Number: 4049094
zbMATH Keywords: rewriting systems
zbMATH Keywords: free partially commutative monoid
zbMATH Keywords: decidable word problem
zbMATH Keywords: finite Thue systems
MaRDI profile type: Publication
full work available at URL: 0020-0190(87)90032-9
OpenAlex ID: W2072390086
cites work: An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
cites work: Confluent and Other Types of Thue Systems
cites work: Q3939790
cites work: Testing for the Church-Rosser property
cites work: Q3736919
cites work: Maximal serializability of iterated transactions
cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
cites work: The undecidability of the preperfectness of Thue systems
cites work: Q3738586
description: scientific article; zbMATH DE number 4049094