Abstract
THE most rational way of constructing a theory of discrete self-organizing systems seems to be on the basis of the structural theory of automata (see [1] or [2]). A self-organizing system is represented in the form of a logical network having a variable structure and sometimes with a number of elements varying with time. Naturally by remaining on the level of the abstract theory of automata we lose the large number of possible definitions. The present paper attempts to show that, in spite of the qualifications mentioned and within the limits of the abstract theory of automata, it is possible to construct a satisfactory theory of self-organizing systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: USSR Computational Mathematics and Mathematical Physics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
