Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Literatur
Boone W.W., Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups. Ann. of Math. 84 (1966), 49–84.
Cannonito F.B., Hierarchies of computable groups and the word problem. J. of Symb. Logic 31 (1966), 376–392.
Cannonito F.B., Gatterdam R.W., The computability of group constructions, Part I, in Word problems. North-Holland (1973), 365–400.
Davis M., Computability and unsolvability. Mac Graw Hill (1958).
Gatterdam R.W., The Higman theorem for En (A) computable groups, in Lecture Notes Math. 319, Springer (1973), 71–74.
von Henke, Weihrauch, Indermark, Hierarchies of primitive recursive wordfunctions and transductions defined by automata, in Nivat (Ed.), IRIA Symposium July 3–7 (1972).
Meyer A., Ritchie D., A classification of the recursive functions, Z. math. Logik, Grundlagen d. Math. 18 (1972), 71–82.
Rotman J.J., The theory of groups, 2. Edition, Allyn & Bacon (1973).
Weihrauch K., Teilklassen primitiv-rekursiver Wortfunktionen, GMD Berichte, Bonn, Nr. 91 (1974).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avenhaus, J., Madlener, K. (1975). En∖En−1-entscheidbare Gruppen. In: Brakhage, H. (eds) Automata Theory and Formal Languages. Lecture Notes in Computer Science, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07407-4_5
Download citation
DOI: https://doi.org/10.1007/3-540-07407-4_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07407-6
Online ISBN: 978-3-540-37923-2
eBook Packages: Springer Book Archive