New decision algorithms for finitely presented commutative semigroups
type: Item
instance of: scholarly article
title: New decision algorithms for finitely presented commutative semigroups
zbMATH Open document ID: 0449.20059
DOI: 10.1016/0898-1221(81)90115-2
author: A. M. Ballantyne
author: Dallas Lankford
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 20M05
Mathematics Subject Classification ID: 68T99
Mathematics Subject Classification ID: 20M35
Mathematics Subject Classification ID: 20M14
zbMATH DE Number: 3702960
zbMATH Keywords: decision algorithms
zbMATH Keywords: finitely presented commutative semigroups
zbMATH Keywords: uniform word problem
zbMATH Keywords: completion procedure for commutative associative term rewriting systems
zbMATH Keywords: Church-Rosser term rewriting system
MaRDI profile type: Publication
full work available at URL: 0898-1221(81)90115-2
OpenAlex ID: W2099954293
cites work: Q5581665
cites work: Q5805025
cites work: On theories with a combinatorial definition of 'equivalence'
cites work: A Decision Problem for Transformations of Trees
cites work: Q3896523
cites work: Some algorithmic problems for finitely defined commutative semigroups
cites work: Q3869335
cites work: Q5343411
cites work: Constructions in Algebra
cites work: Q4152749
cites work: The Isomorphism Problem for Some Classes of Multiplicative Systems
cites work: Q3869404
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 3702960