Abstract
Schemes with discrete functioning are ordinarily presented in the form of graphs whose directed edges are lines for transmitting information while the nodes are functional elements. Functions of memoryless schemes can be obtained as superpositions of functions of operating (functioning) elements.
Original article submitted September 10, 1968.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literature Cited
G. A. Andreev, “Application of k-valued logic to schematic synthesis of mathematical machines” (diploma thesis), RFF GGU (1956).
T. I. Kir’yanova, “Synthesis of electronic computers and control schemes by means of valued logic” (diploma thesis), RFF GGU (1956).
N. A. Loginova, “Synthesis of digital computers and control schemes by means of many-valued logic” (diploma thesis), RFF GGU (1957).
S. V. Yablonskii, Proceedings of the All-Union Mathematical Society, Vol. 3, Akad. Nauk SSSR (1956), pp. 425–431.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1973 Consultants Bureau, New York
About this chapter
Cite this chapter
Vinogradov, Y.A. (1973). On Finite Model Schemes Having Discrete Functioning. In: Lyapunov, A.A. (eds) Systems Theory Research. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-0079-4_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-0079-4_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-0081-7
Online ISBN: 978-1-4757-0079-4
eBook Packages: Springer Book Archive