Compressed Words and Automorphisms in Fully Residually Free Groups

We show that the compressed word problem in a finitely generated fully residually free group (F-group) is decidable in polynomial time, and use this result to show that the word problem in the automorphism group of an F-group is decidable in polynomial time. Contents 1 Preliminaries 1

• Type: Journal
• Year: 2010
• Where: IJAC
• Authors: Jeremy MacDonald
• Keywords: Compressed Word Problem, IJAC 2010, Polynomial Time, Word Problem