This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Avenhaus, J., Madlener, K.: Polynomial time algorithms for the Nielsen reduction and related problems in free groups. Interner Bericht 30/80, FB Informatik, Univ. Kaiserslautern, 1980
Avenhaus, J., Madlener, K.: Polynomial algorithms for problems in free groups based on Nielsen type arguments. Interner Bericht 31/80, FB Informatik, Univ. Kaiserslautern, 1980
Avenhaus, J., Madlener, K.: P-complete problems in free groups, 5th GI Conference on Theoretical Informatics, Karlsruhe 1981.
Howson, A.G.: On the intersection of finitely generated free groups, J. London Math. Soc. 29, 428–434 (1954)
Imrich, W.: On finitely generated subgroups of free groups Arch. Math. 28, 21–24 (1977)
Lyndon, R.C., Schupp, P.E.: Combinatorial group theory, Springer Verlag, Berlin 1977
Magnus, W., Karrass, A., Solitar, D.: Combinatorial group theory, New York, 1966
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avenhaus, J., Madlener, K. (1981). How to compute generators for the intersection of subgroups in free groups. In: Astesiano, E., Böhm, C. (eds) CAAP '81. CAAP 1981. Lecture Notes in Computer Science, vol 112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10828-9_56
Download citation
DOI: https://doi.org/10.1007/3-540-10828-9_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10828-3
Online ISBN: 978-3-540-38716-9
eBook Packages: Springer Book Archive