Part of the Lecture Notes in Computer Science book series (LNCS, volume 122)
On formal transformations of algorithms
KeywordsMonotonous Operator Ukrainian Academy Program Scheme Automatize Design System Formal Transformation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Glushkov V.M., Automata theory and formal transformations of microprograms, Kibernetika, No.5, 1965 (in Russian).Google Scholar
- 2.Letichevsky A.A., On a speeding up the iterations of monotonous operators, Kibernetika, No.4, 1976 (in Russian).Google Scholar
- 3.Glushkov V.M., Kapitonova Yu.V., Letichevsky A.A., Theoretical foundations of discrete systems design, Kibernetika, No.6, 1977 (in Russian).Google Scholar
- 4.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)Google Scholar
- 5.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).Google Scholar
- 6.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.Google Scholar
- 7.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).Google Scholar
- 8.Tarjan R.E., Depth first search and linear graph algorithms, SIAM J.Comput., v.1, No.2, 1972.Google Scholar
© Springer-Verlag Berlin Heidelberg 1981