A collective of stateless automata in a $n$-dimensional environment as a distributed dynamic automaton-like object: a model and its corollaries
نویسنده
چکیده
In this work a collective of interacting stateless automata in a discrete geometric n-dimenstional environment is considered as an integral automaton-like computational dynamic object. For such distributed on the environment object different approaches to definition of the measure of state transition are possible. We propose an approach for defining what a state is. The approach is based on the concept of relativity in Poincaré’s interpretation.
منابع مشابه
A state of a dynamic computational structure distributed in an environment: a model and its corollaries
In this work a collective of interacting stateless automata in a discrete geometric environment is considered as an integral automata-like computational dynamic object. For such distributed on the environment object different approaches to definition of the measure of state transition are possible. We propose an approach for defining what a state is.
متن کاملA measure of state transition of collective of stateless automata in discrete environment
This is an introductory paper in which we rise and study two fundamental problems related to the analysis of a computational dynamic object distributed on the environment: • How to define unambiguously what is the state of such object? • How to measure the amount of state transitions in this case? The main idea of the paper is to show that the state of such computational dynamic object distribu...
متن کاملCloud modeling of quasi - order groups on general fuzzy automata
In this paper, first a simplified version of a general fuzzy automaton with a fixed c is defined and then a subepisode of a simplified version of a general fuzzy automaton with a constant c is defined and explained connected and strong connected them, and finally, a model of quasi-order hypergroup on general fuzzy automaton with constant c is presented and the relationships between them are rev...
متن کاملDISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...
متن کاملUtilizing Generalized Learning Automata for Finding Optimal Policies in MMDPs
Multi agent Markov decision processes (MMDPs), as the generalization of Markov decision processes to the multi agent case, have long been used for modeling multi agent system and are used as a suitable framework for Multi agent Reinforcement Learning. In this paper, a generalized learning automata based algorithm for finding optimal policies in MMDP is proposed. In the proposed algorithm, MMDP ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1012.2203 شماره
صفحات -
تاریخ انتشار 2010