Showing that a Particular Word Problem is Decidable I need to give an algorithm to show that the word problem in the group $\langle x,y \mid \mid x^{1984} = y^{2014} = 1 \rangle$ is decidable. How do I show this? I'm not too sure where to start.
Hint: Come up with a normal form for words in this group.