Polynomial-Time Word Problem for HNN Extensions of Free Groups

A new study shows the word problem for HNN extensions of free groups with equal finite‑index subgroups is solvable in polynomial time, using a bounded rewriting system. getnews.me/polynomial-time-word-pro... #hnnextension #wordproblem