%0 Journal Article %A Avenhaus, J. %A Madlener, K. %T An algorithm for the word problem in $HNN$ extensions and the dependence of its complexity on the group representation %J RAIRO. Informatique théorique %D 1981 %P 355-371 %V 15 %N 4 %I EDP-Sciences %G en %F ITA_1981__15_4_355_0