Compressed words and automorphisms in fully residually free groups
classification
🧮 math.GR
keywords
groupcompresseddecidablefreefullypolynomialproblemresidually
read the original abstract
We show that the compressed word problem in a finitely-generated fully residually free group (F -group) is decidable in polynomial time, and use the result to show that the word problem in the automorphism group of such a group is decidable in polynomial time.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.