ShopSpell

Foundations of System Theory Finitary and Infinitary Conditions [Paperback]

$45.99     $54.99    16% Off      (Free Shipping)
100 available
  • Category: Books (Science)
  • Author:  Anderson, Brian D.O., Arbib, Michael A., Manes, E. G.
  • Author:  Anderson, Brian D.O., Arbib, Michael A., Manes, E. G.
  • ISBN-10:  3540076115
  • ISBN-10:  3540076115
  • ISBN-13:  9783540076117
  • ISBN-13:  9783540076117
  • Publisher:  Springer
  • Publisher:  Springer
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Feb-1976
  • Pub Date:  01-Feb-1976
  • SKU:  3540076115-11-SPRI
  • SKU:  3540076115-11-SPRI
  • Item ID: 100781881
  • List Price: $54.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jan 31 to Feb 02
  • Notes: Brand New Book. Order Now.
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].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 wl,
Add Review