Foundations of system theory: multidecomposable systems

✍ Scribed by Brian D.O. Anderson; Michael A. Arbib; Ernest G. Manes

• Publisher: Elsevier Science
• Year: 1976
• Tongue: English
• Weight: 612 KB
• Volume: 301
• Category: Article
• ISSN: 0016-0032
• DOI: 10.1016/0016-0032(76)90074-0

✦ Synopsis

The paper diacuaaes multilinear, and more generally multidewmposable, machines. An m-linear machine is shown to be redizable aa a network of k-linear machinea for k <(m-I), linked by certain memoryka.4 m-linear map.3. In this way, an m-linear machine can be broken down into linear machines and multilinear memorylea maps. * The research reported in this paper was supported in part by NSF Grant No. GJ35759, which also supported Dr. Anderson's tenure as a Visiting Professor at the University of Massachusetts, September 1973-February 1974. t We use the notation I* for the countable copower of I [see (2) for basic concepts undefined here]. For a vector space I, Is is the vector space of all left-infinite sequences with finite support (. . . , i,, i i ) of I-vectors.