This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Glushkov V.M., Automata theory and formal transformations of microprograms, Kibernetika, No.5, 1965 (in Russian).
Letichevsky A.A., On a speeding up the iterations of monotonous operators, Kibernetika, No.4, 1976 (in Russian).
Glushkov V.M., Kapitonova Yu.V., Letichevsky A.A., Theoretical foundations of discrete systems design, Kibernetika, No.6, 1977 (in Russian).
Glushkov V.M., Kapitonova Yu.V., Letichevsky A.A., On application of formalized specification method to the design of data structures manipulation problems, Programmirovanie, No.6, 1978 (in Russian)
Letichevsky A.A., Godlevsky, Optimization of algorithms during their design by formalized specification method, Avtomatizacija proektirovanija EVM i ikh komponentov, IC Ukr.Acad of Sci.,Kiev, 1977 (in Russian).
Hopcroft J.E., An n log n algorithm for minimizing states in a finite automata, in Kohavi Z., Paz A. (edrs) Theory of machines and computations, Acad.Press, N.-Y, 1971.
Glushkov V.M., Kapitonova Yu.V., Letichevsky A.A., Instrumental tools for the design of programs for processing mathematical texts, Kibernetika, No.2, 1979 (in Russian).
Tarjan R.E., Depth first search and linear graph algorithms, SIAM J.Comput., v.1, No.2, 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Glushkov, V.M. (1981). On formal transformations of algorithms. In: Ershov, A.P., Knuth, D.E. (eds) Algorithms in Modern Mathematics and Computer Science. Lecture Notes in Computer Science, vol 122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11157-3_40
Download citation
DOI: https://doi.org/10.1007/3-540-11157-3_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11157-3
Online ISBN: 978-3-540-38621-6
eBook Packages: Springer Book Archive