Skip to main content
  • Book
  • © 1976

Foundations of System Theory: Finitary and Infinitary Conditions

Part of the book series: Lecture Notes in Economics and Mathematical Systems (LNE, volume 115)

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (6 chapters)

  1. Front Matter

    Pages N1-VII
  2. A General Setting for Discrete Action Nonlinear Systems

    • Brian D. O. Anderson, Michael A. Arbib, Ernest G. Manes
    Pages 1-26
  3. Nerode Equivalence Approach

    • Brian D. O. Anderson, Michael A. Arbib, Ernest G. Manes
    Pages 27-42
  4. Tree Automata: Finite Successes and Infinite Failures

    • Brian D. O. Anderson, Michael A. Arbib, Ernest G. Manes
    Pages 43-62
  5. Finite Step Conditions

    • Brian D. O. Anderson, Michael A. Arbib, Ernest G. Manes
    Pages 63-80
  6. Augmenting the Process

    • Brian D. O. Anderson, Michael A. Arbib, Ernest G. Manes
    Pages 81-88
  7. Conclusions

    • Brian D. O. Anderson, Michael A. Arbib, Ernest G. Manes
    Pages 89-91
  8. Back Matter

    Pages 92-97

About this book

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].

Authors and Affiliations

  • Department of Electrical Engineering, University of Newcastle, Australia

    Brian D. O. Anderson

  • Department of Computer and Information Science, University of Massachusetts, Amherst, USA

    Michael A. Arbib

  • Department of Mathematics, University of Massachusetts, Amherst, USA

    Ernest G. Manes

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access