The following pages link to (Q3839876):
Displaying 8 items.
- On a connection between the word problem and decidability of the equational theory (Q1595492) (← links)
- Solvability of context equations with two context variables is decidable (Q1599536) (← links)
- On locally finite varieties with undecidable equational theory. (Q1771892) (← links)
- The non-parametrizability of the word equation \(xyz=zvx\): a short proof (Q2575750) (← links)
- The equational theory of a nontrivial discriminator variety is co-NP-hard (Q2577705) (← links)
- Pseudorecursive varieties of semigroups. II (Q2909488) (← links)
- A decidable word problem without equivalent canonical term rewriting system (Q3816049) (← links)
- A Variety with Solvable, but not Uniformly Solvable, Word Problem (Q4290004) (← links)