A GENERAL SYSTEMS THEORY FOR STUDIES IN CYBERNETICS AND AUTOMATION—PART II Available to Purchase

Part I, presented in the preceding issue of Kybernetes, concluded with the presentation of a theorem in the form of an algorithm to aid in the modeling of the inherited ability of an automaton to modify and extend its knowledge structures. Part II continues with the presentation of the proof of the theorem, and the theorem is applied to a case study to determine the states of an automaton when the states could not be observed during a period of performance. The application of the disciplines of the General Systems Theory is further indicated for a second case study of an industrial system of 10 interactive automata.