Compressed words and automorphisms in fully residually free groups
arXiv:0908.0569
Abstract
We show that the compressed word problem in a finitely-generated fully residually free group (F -group) is decidable in polynomial time, and use the result to show that the word problem in the automorphism group of such a group is decidable in polynomial time.
Proof of Theorem 9 (now Theorem 10) clarified, improved notation. 13 pages