On algorithmic decidability of the square-free word problem relative to a system of two defining relations
arXiv:1203.0334
Abstract
The square-free word problem relative to a system of two defining relations is decidable.
arXiv:1203.0334
The square-free word problem relative to a system of two defining relations is decidable.