Efficient solution of the word problem in slim varieties

DOI10.1007/BF01188181zbMath0804.08004MaRDI QIDQ1315326

John Pedersen

Publication date: 16 January 1995

Published in: Algebra Universalis (Search for Journal in Brave)

zbMATH Keywords

word problemcritical pairKnuth-Bendix procedureconfluence-completion methodcritical computability

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Free algebras (08B20) Word problems (aspects of algebraic structures) (08A50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New decision algorithms for finitely presented commutative semigroups
• An algebra has a solvable word problem if and only if it is embeddable in a finitely generated simple algebra
• The lattice of semigroup varieties
• On theories with a combinatorial definition of 'equivalence'
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• The Word Problem for Free Lattice-Ordered Groups (and Some Other Free Algebras)
• Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
• A Decision Problem for Transformations of Trees

This page was built for publication: Efficient solution of the word problem in slim varieties