N. L. Poliakov, “On the algorithmic decidability of the square-free word problem relative to a system of two defining relations”, Contemporary Mathematics and Its Applications, 2013, Volume 88,Pages <nobr>84

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

N. L. Poliakov

Financial University under the Government of the Russian Federation, Moscow

Abstract: We prove that the square-free word problem relative to a system of two defining relations is algorithmically decidable.

UDC: 512.5