Affiliation:
1. Department of Computer Sciences Tbilisi State University University St. 2, Tbilisi 0143 GEORGIA
Abstract
The behavior of two types of finite automata in a non-stationary fuzzy environment is considered, which, depending on the states of the automata, encourages or punishes them with some fixed membership functions. It is assumed that the behavior of automata in a fuzzy environment is described by generalized ergodic Markov chains and, using the property of such chains, it is shown that the considered automata, under certain conditions on fuzzy punishment functions, are learners and predominantly perform the action for which the sum of fuzzy functions of belonging to punishment is minimal.
Publisher
World Scientific and Engineering Academy and Society (WSEAS)
Subject
Computer Science Applications,Information Systems
Reference12 articles.
1. Neumann, J., The theory of self-replicating automata. M., Science, 1971.
2. Tsetlin, M.L., On the behavior of finite automata in random environments. Automation and telemechanics, N10, 1961.
3. Robbins, H., A Sequential DecisionProblem with a Finite Memory. Proc. Of Nat. Acad. Of Science of USA, 42, 3, 1956.
4. Krinsky, V.I., Asymptotically optimal automaton with exponential rate of convergence. Biophysics 9, issue 4, 1964. pp. 67-71.
5. Korolyuk, V.S., Pletnev, A.I., Eidelman, S.D., Automata. Walks. Games. Successes of Mathematical Sciences. T. 43, issue 1 (259), 1988, pp. 87-122.