On Finite Model Schemes Having Discrete Functioning

Yu. A. Vinogradov

A chapter in Systems Theory Research, 1973, pp 121-128 from Springer

Abstract: 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.

Date: 1973
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4757-0079-4_6

Ordering information: This item can be ordered from
http://www.springer.com/9781475700794

DOI: 10.1007/978-1-4757-0079-4_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().