Reversibility of Linear Cellular Automata on Cayley Trees with Periodic Boundary Condition
نویسندگان
چکیده
منابع مشابه
Reversibility of Linear Cellular Automata on Cayley Trees with Periodic Boundary Condition
While one-dimensional cellular automata have been well studied, there are relatively few results about multidimensional cellular automata; the investigation of cellular automata defined on Cayley trees constitutes an intermediate class. This paper studies the reversibility of linear cellular automata defined on Cayley trees with periodic boundary condition, where the local rule is given by f(x0...
متن کاملAlmost Periodic Configurations on Linear Cellular Automata
We study computational properties of linear cellular automata on configurations that differ from spatially periodic ones in only finitely many places. It is shown that the degree structure of the orbits of cellular automata is the same on these configurations as on the space of finite configurations. We also show that it is undecidable whether the cellular automaton exhibits complicated behavio...
متن کاملReversibility of general 1D linear cellular automata over the binary field Z2 under null boundary conditions
The reversibility of cellular automata(CA) has long been studied but there are still many problems untouched. This paper tackles the reversibility problem of the general case concerning 1D CA under null boundary conditions defined by linear rules over the binary field Z2. Although transition matrix has been widely used for some special linear CA(LCA) rules, it has severe limitations: its comple...
متن کامل2-Dimensional Reversible Hexagonal Cellular Automata with Periodic Boundary
The hexagonal nite cellular automata (shortly HFCA) are 2-dimensional (2D) cellular automata whose cells are of the form of hexagonal. Morita et al. [1] introduced this type of cellular automaton (CA) and they called it hexagonal partitioned CA (HPCA). A remarkable application of the family of these CAs is presented by Trun o [2] where a model is presented to simulate the evolution of forest re...
متن کاملSimulations Between Cellular Automata on Cayley Graphs
We consider cellular automata on Cayley graphs and compare their computational powers according to the architecture on which t h e y work. We show that, if there exists a homomorphism with a nite kernel from a group into another one such that the image of the rst group has a nite index in the second one, then every cellular automaton on the Cayley graph of one of these groups can be uni-formall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2017
ISSN: 1027-5487
DOI: 10.11650/tjm/8032