Literature Cited
Yu. G. Skukuryan and A. K. Ter-Akopov, “Tabular programs and discrete transformations. I” Kibernetika, No. 3 (1978).
A. A. Letichevskii, “Equivalence of automata with final states,” Kibernetika, No. 4 (1966).
Yu. G. Shukuryan, “Mean-speed optimal automata with final states without loops,” Kibernetika, No. 4 (1968).
V. M. Glushkov and A. A. Letichevskii, Theory of Discrete Transformations: Selected Topics in Algebra and Logic [in Russian], Sibirsk. Otd., Nauka Novosibirsk (1973).
Yu. G. Shukuryan, “The mean speed of an automaton with a final state,” in: Programming Theory. I [in Russian], Novosibirsk (1973).
Yu. G. Shukuryan, “Comparison of automata with final states for speed within an equivalence class,” Kibernetika, No. 1 (1971).
A. K. Ter-Akopov, “Optimization of a discrete transformation for speed with respect to automata compositions,” Kibernetika, No. 5 (1975).
P. R. Halmos, Measure Theory, Van Nostrand-Reinhold (1950).
W. Feller, An Introduction to Probability Theory and Its Applications, Wiley (1957).
Additional information
Translated from Kibernetika, No. 6, pp. 27–32, November–December, 1978.
Rights and permissions
About this article
Cite this article
Shukuryan, Y.G. Tabular programs and discrete transformations. II. Cybern Syst Anal 14, 834–839 (1978). https://doi.org/10.1007/BF01070275
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01070275