Abstract
We show that the compressed word problem in a finitely generated fully residually free group ([Formula: see text]-group) is decidable in polynomial time, and use this result to show that the word problem in the automorphism group of an [Formula: see text]-group is decidable in polynomial time.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
