Sciweavers

IJAC
2010
128views more  IJAC 2010»
13 years 3 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 ...
Jeremy MacDonald