Abstract

It is shown that the compressed word problem for an HNN-extension 〈H,t∣t −1 at=ϕ(a) (a∈A)〉 with A finite is polynomial time Turing-reducible to the compressed word problem for the base group H. An analogous result for amalgamated free products is shown as well.

Full Text
Published version (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