References
W. Magnus, A. Karras, and D. Solitar, Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations, Wiley Interscience, New York (1966).
A. A. Letichevskii, A. B. Godlevskii, and S. L. Krivoi, “An efficient algorithm for the construction of the basis of a subgroup of a free group,” Kibernetika, No. 3, 107–116 (1981).
J. Avenhaus and K. Madlener, “Polynomial time algorithms for the Nielsen reduction and related problems in free groups,” Interner Bericht 30/80, pp. 27–42, FB Informatik, Univ. Kaiserslautern (1980).
A. A. Letichevsky and J. V. Kapitonova, “Algebraic programming in APS system,” Proc. ISSAC '90, Tokyo, Japan, August 20–24 (1990), pp. 68–75.
J. Davenport, I. Sire, and E. Tournier, Computer Algebra [Russian translation], Mir, Moscow (1991).
B. Buchberger, J. Collins, and R. Loos (eds.), Computer Algebra [Russian translation], Mir, Moscow (1986).
A. A. Letichevsky, A. A. Kapitonova, and S. V. Konozenko, “Computations in APS,” Informatika '91, Franco-Soviet Symp.: Theoretical Computer Science and Methods of Compilation and Program Construction, Grenoble, Oct. 16–18 (1991), pp. 133–152.
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 126–133, September–October, 1994.
Rights and permissions
About this article
Cite this article
Letichevskii, A.A., Krivoi, S.L. Implementation of the nielsen algorithm in the algebraic programming system APS-1. Cybern Syst Anal 30, 740–746 (1994). https://doi.org/10.1007/BF02367756
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02367756