@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}, volume = {15}, year = {1981}, pages = {355-371}, mrnumber = {670729}, zbl = {0494.20020}, language = {en}, url = {http://dml.mathdoc.fr/item/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) pp. 355-371. http://gdmltest.u-ga.fr/item/ITA_1981__15_4_355_0/
1. Subrekursive Komplexität bei Gruppen I. Gruppen mit vorgeschriebener Komplexität. Acta Inf., Vol. 9, 1977, pp. 87-104. | MR 498062 | Zbl 0371.02019
and ,2. Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität, Arch. math. Logik, Vol. 19. 1978, pp. 3-12. | MR 514453 | Zbl 0396.03040
and ,3. Between Logic and Group Theory. Proc. Second Internat. Conf. Theory of Groups, Camberra, 1973. L.N.M. 372, pp. 90-102. | MR 354880 | Zbl 0298.20027
,4. 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. | MR 446938 | Zbl 0274.02017
and ,5. The Word Problem and Power Problem in 1 - Relator Groups are Primitive Recursive, Pacific J. Math. Vol. 61. 1975. pp. 351-359. | MR 401452 | Zbl 0335.02029
and ,6. Combinatorial Group Theory, Berlin, Heidelberg, New York, 1977. | MR 577064 | Zbl 0368.20023
and ,7. Rekursive Funktionen und ihre Komplexität, Teubner, 1974. | MR 462927 | Zbl 0299.02043
,