An algorithm for the word problem in $HNN$ extensions and the dependence of its complexity on the group representationJ. Avenhaus and K. MadlenerRAIRO. Inform. théor., 15 4 (1981) 355-371DOI: https://doi.org/10.1051/ita/1981150403551
