Representations of commutative asynchronous automata
نویسندگان
چکیده
منابع مشابه
Commutative Data Automata
Formalisms over infinite alphabets have recently received much focus in the community of theoretical computer science. Data automaton is a formal model for words over an infinite alphabet, that is, the product of a finite set of labels and an infinite set of data values, proposed by Bojanczyk, Muscholl, Schwentick et. al. in 2006. A data automaton consists of two parts, a nondeterministic lette...
متن کاملCommutative Cellular Automata
Totalistic cellular automata were introduced by Wolfram [1, 2] as a means of studying higher-color cellular automata within a reasonable space of possible rules. The underlying principle is to systematically construct a subset of rules within all the possible rules of the highercolor cellular automata, and the system in totalistic cellular automata is to add up the values of the cells within th...
متن کاملImplementing Realistic Asynchronous Automata
Zielonka’s theorem, established 25 years ago, states that any regular language closed under commutation is the language of an asynchronous automaton (a tuple of automata, one per process, exchanging information when performing common actions). Since then, constructing asynchronous automata has been simplified and improved [6, 20, 7, 12, 8, 4, 2, 21, 22]. We first survey these constructions and ...
متن کاملAsynchronous cellular learning automata
Cellular learning automata is a combination of cellular automata and learning automata. The synchronous version of cellular learning automata in which all learning automata in different cells are activated synchronously, has found many applications. In some applications a type of cellular learning automata in which learning automata in different cells are activated asynchronously (asynchronous ...
متن کاملAsynchronous logic automata
Numerous applications, from high-performance scientific computing to large, highresolution multi-touch interfaces to strong artifical intelligence, push the practical physical limits of modern computers. Typical computers attempt to hide the physics as much as possible, running software composed of a series of instructions drawn from an arbitrary set to be executed upon data that can be accesse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2012
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2011.06.002