This is a preview of subscription content, log in via an institution to check access.
References
A. B. Godlevskii, Yu. V. Kapitonova, S. L. Krivoi, and A. A. Letichevskii, “Iterative methods of program analysis, ” Kibernetika, No. 2, 9–19 (1989).
V. V. Bublik and S. S. Gorokhovskii, “Algebraic interpretation of data structures,” Kibernetika, No. 2, 10–15 (1978).
S. L. Krivoi, “Algorithms to compute congruent closures of finite automata and some applications,” Kibernetika i Sistemnyi Analiz, No. 1, 33–44 (1994).
S. L. Krivoi, “Generalization of algorithms to find invariant relationships in programs over the algebra of terms,” Kibernetika i Sistemnyi Analiz, No. 1, 24–36 (1996).
S. L. Krivoi, “A basis of the intersection of term equality sets in a free algebra with the commutativity relationship,” Dop. NAN Ukr., No. 4, 62–64 (1996).
S. L. Krivoi, “Algorithm to construct the basis of intersection of finitely generated free groups,” Kibernetika, No. 4, 5–10 (1982).
A. Clifford and G. Preston, Algebraic Theory of Semigroups [Russian translation], Vol. 2, Mir, Moscow (1972).
A. Sgrijver, Linear and Integer Programming Theory [Russian translation], Mir, Moscow (1991).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 3–14, September–October, 1998.
Rights and permissions
About this article
Cite this article
Krivyi, S.L. Intersection of term equality sets in finitely defined algebras. Cybern Syst Anal 34, 635–644 (1998). https://doi.org/10.1007/BF02667035
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02667035