Sciweavers

IJAC
2010

Compressed Words and Automorphisms in Fully Residually Free Groups

13 years 11 months ago
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
Jeremy MacDonald
Added 27 Jan 2011
Updated 27 Jan 2011
Type Journal
Year 2010
Where IJAC
Authors Jeremy MacDonald
Comments (0)