This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, Automation of Calculating Machine Design [in Russian], Naukova Dumka, Kiev (1975).
S. V. Yablonskii (editor), Discrete Mathematics andMathematical Questions of Cybernetics [in Russian], Vol. 1, Nauka, Moscow (1974).
V. M. Glushkov and A. A. Letichevskii (Letichevsky), “Theory of algorithms and discrete processors,” Adv. Inf. Syst. Sci.,1, 1–58 (1969).
Yu. V. Kapitonova, “Discrete systems and problems of their realization,” Kibernetika, No. 4, 5 (1975).
V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Methods of designing calculating machines of the fourth and succeeding generations,” Kibernetika, No. 1 (1973).
V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “On the facilities for the description of circuit and program equipment of electronic computers,” Kibernetika, No. 6 (1974).
Z. Pawlak, “Programming machines,” Algorytmy,10, 7–22 (1969).
J. A. Goguen, Jr., “On homomorphisms, correctness, termination, unfoldments, and equivalence of flow programs diagrams,” J. Comput. Syst. Sci.,8, No. 2, 333–365 (1974).
V. M. Glushkov, Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).
V. M. Glushkov, “Theory of automata and formal microprogram conversion,” Kibernetika, No. 5 (1965).
V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, Algebra. Languages. Programming [in Russian], Naukova Dumka, Kiev (1974).
V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Principles of the mathematical theory of algorithm design,” in: Questions of Organization and Optimization of Calculations [in Russian], RDENTP, Kiev (1975).
A. A. Letichevskii, “Analysis of programs toverify the contradictoriness of propositional formulas,” in: Discrete Converters [in Russian], Izd. IK AN UkrSSR, Kiev (1967).
V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Theory of structures of data and synchronized parallel calculations,” Kibernetika, No. 6 (1976).
E. Dyckstra, U. Dale, and Hoare, Structural Programming [Russian translation], Mir, Moscow (1975).
N. Wirth, “Program development by stepwise refinement,” Commun. ACM,17, No. 2, 83–93 (1974).
D. Scott, “Outline of mathematical theory of computations,” in: The Proceedings of the Fourth Annual Princeton Conference on Information Sciences and Systems Princeton University (1970), pp. 169–176.
Z. Manna and J. Vuillemin, “Fixed-point approach tothe theory of computations,” Commun. ACM,15, No. 7, 528–536 (1972).
A. A. Letichevskii, “On acceleration of iterations of monotonic operators,” Kibernetika, No. 4 (1976).
Automation of Electronic Computer and Component Design [in Russian], Izd. IK AN UkrSSR, Kiev (1977).
M. I. Auguston, R. P. Balodis, Ya. M. Barzdin', and A. A. Kalnin'sh, Subset PL/1 OCEC [in Russian], Izd. Latviisk. Univ., Riga (1976).
V. E. Kotov, “Theory of parallel programming. Applied aspects,” Kibernetika,No. 1, 2 (1974).
D. J. Kuck, “A survey of parallel machine organization and programming,” Comput. Surv. (1977).
L. Lamport, “The parallel execution of Do loops,” Commun. ACM,17, No. 2, 83–93 (1974).
A. Mazurkiewicz, “Parallel recursive program schemes,” Lect. Notes Comput. Sci., 34 (1975).
V. M. Glushkov, M. B. Ignatiev, V. A. Myasnikov (Miasnicov), and V. A. Torgashev, “Recursive machines and computing technology,” in: International Federation of Information Processing Congress-74, Stockholm (1974), pp. 65–70.
Additional information
Translated from Kibernetika, no. 6, pp. 5–20, November–December, 1977.
Rights and permissions
About this article
Cite this article
Glushkov, V.M., Kapitonova, Y.V. & Letichevskii, A.A. Theoretical principles for designing discrete systems. Cybern Syst Anal 13, 799–813 (1977). https://doi.org/10.1007/BF01068847
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068847