This is a preview of subscription content, log in via an institution to check access.
Literature Cited
A. A. Letichevskii, A. B. Godlevskii, and S. L. Krivoi, “On an effective algorithm to construct the basis of a subgroup of a free group,” Kibernetika, No. 3, 107–116 (1981).
S. L. Krivoi, “On an algorithm to construct the basis of intersections of finitely generated free groups,” Kibernetika, No. 4, 5–10 (1982).
A. A. Letichevskii, “On an approach to program analysis,” Kibernetika, No. 6, 1–8 (1979).
W. Magnus et al., Combinatorial Group Theory, Springer-Verlag (1966).
V. M. Glushkov, Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).
J. Avenhaus and K. Madlener, “How to compare generators for the intersection of subgroups in free groups,” Lect. Notes Comp. Sci., No. 112, 88–100 (1981).
A. B. Godlevskii and S. L. Krivoi, “On optimization of programs planned by the “updown” methods,” Mod. Sist. Obrab. Inf., No. 3, 25–33 (1984).
Additional information
Translated from Kibernetika, No. 3, pp. 9–14, 20, May–June, 1985.
Rights and permissions
About this article
Cite this article
Krivoi, S.L. Efficiency of certain algorithms of combinatorial group theory. Cybern Syst Anal 21, 284–292 (1985). https://doi.org/10.1007/BF01078821
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01078821