On algorithmic decidability of the square-free word problem relative to   a system of two defining relations
  The square-free word problem relative to a system of two defining relations is decidable. 
Nikolay L. Poliakov
math.LO