On algorithmic decidability of the square-free word problem relative to a system of two defining relations

Nikolay L. Poliakov

The square-free word problem relative to a system of two defining relations is decidable.