The word problem for confluent Thue systems is linear-time
and for almost confluent systems it is
PSPACE-complete. Here we consider a single length-preserving
rule, of the form

A search for normal forms
leads to the conjecture that if

We prove a stronger version of this: in a group