Advertisement

How to compute generators for the intersection of subgroups in free groups

  • J. Avenhaus
  • K. Madlener
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 112)

Keywords

Free Group Polynomial Time Polynomial Time Algorithm Double Coset Trivial Intersection 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AM1]
    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, 1980Google Scholar
  2. [AM2]
    Avenhaus, J., Madlener, K.: Polynomial algorithms for problems in free groups based on Nielsen type arguments. Interner Bericht 31/80, FB Informatik, Univ. Kaiserslautern, 1980Google Scholar
  3. [AM3]
    Avenhaus, J., Madlener, K.: P-complete problems in free groups, 5th GI Conference on Theoretical Informatics, Karlsruhe 1981.Google Scholar
  4. [H]
    Howson, A.G.: On the intersection of finitely generated free groups, J. London Math. Soc. 29, 428–434 (1954)Google Scholar
  5. [I]
    Imrich, W.: On finitely generated subgroups of free groups Arch. Math. 28, 21–24 (1977)Google Scholar
  6. [LS]
    Lyndon, R.C., Schupp, P.E.: Combinatorial group theory, Springer Verlag, Berlin 1977Google Scholar
  7. [MKS]
    Magnus, W., Karrass, A., Solitar, D.: Combinatorial group theory, New York, 1966Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • J. Avenhaus
    • 1
  • K. Madlener
    • 1
  1. 1.Kaiserslautern

Personalised recommendations