scientific article; zbMATH DE number 1186371
From MaRDI portal
Publication:3839876
Recommendations
- scientific article; zbMATH DE number 1123898
- A finitely axiomatizable undecidable equational theory with recursively solvable word problems
- scientific article; zbMATH DE number 1868880
- A Variety with Solvable, but not Uniformly Solvable, Word Problem
- On a connection between the word problem and decidability of the equational theory
- The satisfiability of word equations: decidable and undecidable theories
- scientific article; zbMATH DE number 4016226
- scientific article; zbMATH DE number 35404
- Equational problems and disunification
Cited in
(11)- On a connection between the word problem and decidability of the equational theory
- Solvability of context equations with two context variables is decidable
- On locally finite varieties with undecidable equational theory.
- The non-parametrizability of the word equation \(xyz=zvx\): a short proof
- The equational theory of a nontrivial discriminator variety is co-NP-hard
- Pseudorecursive varieties of semigroups. II
- A decidable word problem without equivalent canonical term rewriting system
- scientific article; zbMATH DE number 1123898 (Why is no real title available?)
- scientific article; zbMATH DE number 1482215 (Why is no real title available?)
- scientific article; zbMATH DE number 1868880 (Why is no real title available?)
- A finitely axiomatizable undecidable equational theory with recursively solvable word problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3839876)
