Dynamics groups of asynchronous cellular automata
نویسندگان
چکیده
منابع مشابه
Dynamics groups of asynchronous cellular automata
We say that a finite asynchronous cellular automaton (or more generally, any sequential dynamical system) is π-independent if its set of periodic points are independent of the order that the local functions are applied. In this case, the local functions permute the periodic points, and these permutations generate the dynamics group. We have previously shown that exactly 104 of the possible 22 3...
متن کاملCoxeter Groups and Asynchronous Cellular Automata
The dynamics group of an asynchronous cellular automaton (ACA) relates properties of its long term dynamics to the structure of Coxeter groups. The key mathematical feature connecting these diverse fields is involutions. Group-theoretic results in the latter domain may lead to insight about the dynamics in the former, and vice-versa. In this article, we highlight some central themes and common ...
متن کامل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 ...
متن کاملWeighted Asynchronous Cellular Automata
We study weighted distributed systems whose behavior can be described as a formal power series over a free partially commutative or trace monoid. We characterize the behavior of such systems both, in the deterministic and in the non-deterministic case. As a consequence, we obtain a particularly simple class of sequential weighted automata that have already the full expressive power.
متن کاملAbrupt Behaviour Changes in Cellular Automata under Asynchronous Dynamics
We propose an analysis of the relaxation time of the elementary finite cellular automaton 214 (Wolfram coding) under αasynchronous dynamics (i.e. each cell independently updates with probability 0 < α 6 1 at each time step). While cellular automata have been intensively studied under synchronous dynamics (all cells update at each time step), much less work is available about asynchronous dynami...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2010
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-010-0231-y