New decision algorithms for finitely presented commutative semigroups
From MaRDI portal
Publication:1147232
DOI10.1016/0898-1221(81)90115-2zbMath0449.20059MaRDI QIDQ1147232
Dallas Lankford, A. M. Ballantyne
Publication date: 1980
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(81)90115-2
decision algorithms; uniform word problem; Church-Rosser term rewriting system; completion procedure for commutative associative term rewriting systems; finitely presented commutative semigroups
20M14: Commutative semigroups
20M05: Free semigroups, generators and relations, word problems
68T99: Artificial intelligence
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
Hilbert's tenth problem is of unification type zero, Termination and completion modulo associativity, commutativity and identity, Efficient solution of the word problem in slim varieties, Buchberger's algorithm: The term rewriter's point of view, Free products with amalgamation of monoids