TY - JOUR AU - Avenhaus, J. AU - Madlener, K. TI - An algorithm for the word problem in $HNN$ extensions and the dependence of its complexity on the group representation JO - RAIRO. Informatique théorique PY - 1981 DA - 1981/// SP - 355 EP - 371 VL - 15 IS - 4 PB - EDP-Sciences UR - http://www.numdam.org/item/ITA_1981__15_4_355_0/ UR - https://zbmath.org/?q=an%3A0494.20020 UR - https://www.ams.org/mathscinet-getitem?mr=670729 LA - en ID - ITA_1981__15_4_355_0 ER -