An algorithm for the word problem in $HNN$ extensions and the dependence of its complexity on the group representation
and
RAIRO. Inform. théor., 15 4 (1981) 355-371
Published online: 01 February 2017
DOI: 10.1051/ita/1981150403551