This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. M. Glushkov, “Theory of automata and formal transformation of microprograms,” Kibernetika, No. 5, 1 (1965).
A. A. Letichevskii, A. B. Godlevskii, and S. L. Krivoi, “On an efficient algorithm of constructing the base of a subgroup of a free group,” Kibernetika, No. 3, 107 (1981).
A. A. Letichevskii, “On speeding up the iteration of monotonous operators,” Kibernetika, No. 4, 1 (1976).
A. A. Letichevskki and A. B. Godlevskii, “Optimization of algorithms in the course of their design using the method of formalized technical assignments,” in: Automatic Design of Computers and Their Components [in Russian], IK AN UkrSSR, Kiev (1977), pp. 46–71.
V. M. Glushkov and A. A. Letichevskii, “Theory of discrete transformers” in Selected Problems in Algebra and Logics [in Russian], Nauka, Novosibirsk (1973), pp. 5–39.
V. M. Glushkov Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).
J. Hopcroft, “An n log n algorithm for minimizing states in finite automata,” in: Theory of Machines and Computation, Proc. Intern. Symp., Haifa (1971), pp. 189–196.
P. J. Downey, R. Sethy, and R. E. Tarjan, “Variation on the common subexpression problem,” J. ACM,27, No. 4, 758 (1980).
J. Corbin and M. Bidoit, “A rehabilitation of Robinson's unification algorithm,” in: Inform. Proc., 83, (R. E. A. Masson, ed.), Elsv. Sci. Publ. B. V., Amsterdam, North-Holland (1983), pp. 909–914.
Additional information
Translated from Kibernetika, No. 6, pp. 37–43, 66, November–December, 1986.
Rights and permissions
About this article
Cite this article
Godlevskii, A.B., Krivoi, S.L. Transformation synthesis of efficient algorithms with auxiliary specifications. Cybern Syst Anal 22, 728–737 (1986). https://doi.org/10.1007/BF01068689
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068689