Geodesic
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.

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/

1. J. Avenhaus and K. Madlener, Subrekursive Komplexität bei Gruppen I. Gruppen mit vorgeschriebener Komplexität. Acta Inf., Vol. 9, 1977, pp. 87-104. | Zbl | MR

2. J. Avenhaus and K. Madlener, Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität, Arch. math. Logik, Vol. 19. 1978, pp. 3-12. | Zbl | MR | EuDML

3. W. W. Boone, Between Logic and Group Theory. Proc. Second Internat. Conf. Theory of Groups, Camberra, 1973. L.N.M. 372, pp. 90-102. | Zbl | MR

4. F. B. Cannonito and R. W. Gatterdam, The Computability of Group constructions I, in Word Problems, W. W. BOONE, F. B. CANNONITO and R. LYNDON, Eds, 1973, pp. 365-400, Amsterdam-London, North Holland. | Zbl | MR

5. F. B. Cannonito and R. W. Gatterdam, The Word Problem and Power Problem in 1 - Relator Groups are Primitive Recursive, Pacific J. Math. Vol. 61. 1975. pp. 351-359. | Zbl | MR

6. R. C. Lyndon and P. E. Schupp, Combinatorial Group Theory, Berlin, Heidelberg, New York, 1977. | Zbl | MR

7. C. P. Schnorr, Rekursive Funktionen und ihre Komplexität, Teubner, 1974. | Zbl | MR