Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Foundations of System Theory: Finitary and Infinitary Conditions

Foundations of System Theory: Finitary and Infinitary Conditions

Anderson, Brian D. O.
Arbib, Michael A.
Manes, E. G.

Paperback

Series: Lecture Notes in Economic and Mathematical Systems, Book 115

EconomicsGeneral MathematicsGeneral Science

ISBN10: 3540076115
ISBN13: 9783540076117
Publisher: Springer Nature
Published: Mar 1 1976
Pages: 99
Weight: 0.41
Height: 0.22 Width: 6.69 Depth: 9.61
Language: English
This paper is one of a series in which the ideas of category theory are applied to problems of system theory. As with the three principal earlier papers, [1-3], the emphasis is on study of the realization problem, or the problem of associating with an input-output description of a system an internal description with something analogous to a state-space. In this paper, several sorts of machines will be discussed, which arrange themselves in the following hierarchy: Input process Machine Output process (Tree automaton) Machine State-behavior Machine I Adjoint Machine .(Sequential Machine) ., I Decomposable Machine (Linear System, Group Machine) Each member of the hierarchy includes members below it; examples are included in parentheaes, and each example is at its lowest possible point in the hierarchy. There are contrived examples of output process machines and IV state-behavior machines which are not adjoint machines [3], but as yet, no examples with the accepted stature of linear systems [4], group machines [5, 6], sequential machines [7, Ch. 2], and tree automata [7, Ch. 4].

Also in

General Science

View All