2 search results - page 1 / 1 » Compressed Words and Automorphisms in Fully Residually Free ... |
IJAC
2010
13 years 3 months ago
2010
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 ...
IJAC
2007
13 years 4 months ago
2007
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...