Abstract

A general fixed structure automaton acting in stationary random multireaction environment is described. Some necessary conditions are shown for automata to be purposeful or adaptive in an unknown environment (to be more profitable than a no-purpose, or random, automaton). By the necessary conditions it is proved that there exists no perfectly adaptive automaton. A necessary condition for automata with minimum state space to be purposeful is obtained. This condition characterizes their structures explicitly, so that a little restriction gives a sufficient condition. Some general subclasses of automata are proposed, and necessary and sufficient conditions for such automata to be purposeful are investigated. Furthermore as properties of a purposeful automaton, the time required to adapt and the stability of adapting to the random environment are discussed.

Full Text
Paper version not known

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 call

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.