Voir la notice de l'article provenant de la source Numdam
@article{ITA_1981__15_4_355_0,
author = {Avenhaus, J. and Madlener, K.},
title = {An algorithm for the word problem in $HNN$ extensions and the dependence of its complexity on the group representation},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {355--371},
publisher = {EDP-Sciences},
volume = {15},
number = {4},
year = {1981},
mrnumber = {670729},
zbl = {0494.20020},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ITA_1981__15_4_355_0/}
}
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 - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1981 SP - 355 EP - 371 VL - 15 IS - 4 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/item/ITA_1981__15_4_355_0/ LA - en ID - ITA_1981__15_4_355_0 ER -
%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 - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1981 %P 355-371 %V 15 %N 4 %I EDP-Sciences %U http://geodesic.mathdoc.fr/item/ITA_1981__15_4_355_0/ %G en %F ITA_1981__15_4_355_0
Avenhaus, J.; Madlener, K. An algorithm for the word problem in $HNN$ extensions and the dependence of its complexity on the group representation. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 15 (1981) no. 4, pp. 355-371. http://geodesic.mathdoc.fr/item/ITA_1981__15_4_355_0/