Efficient solution of the word problem in slim varieties
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3767656 (Why is no real title available?)
- scientific article; zbMATH DE number 3999904 (Why is no real title available?)
- scientific article; zbMATH DE number 3216273 (Why is no real title available?)
- scientific article; zbMATH DE number 3065870 (Why is no real title available?)
- A Decision Problem for Transformations of Trees
- An algebra has a solvable word problem if and only if it is embeddable in a finitely generated simple algebra
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- New decision algorithms for finitely presented commutative semigroups
- On theories with a combinatorial definition of 'equivalence'
- Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
- The Word Problem for Free Lattice-Ordered Groups (and Some Other Free Algebras)
- The lattice of semigroup varieties
Cited in
(3)
This page was built for publication: Efficient solution of the word problem in slim varieties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315326)