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...

We study the topological entropy of a particular class of dynamical systems: cellular automata. The topological entropy of a dynamical system (X; F) is a measure of the complexity of the dynamics of F over the space X . The problem of computing (or even approximating) the topological entropy of a given cellular automata is algorithmically undecidable (Ergodic Theory Dynamical Systems 12 (1992) ...

ventricular fibrillation is the cause of the most sudden deaths. the recent findings have clearly proved the correlation between the slope of restitution curve with ventricular fibrillation. cellular automata is a powerful tool for simulating complex phenomena in a simple language. in this paper, a simple model is proposed for the simulation of the property of restitution in a single cardiac ce...

in the last decade, cellular automata models have been widely used for simulation spatial phenomena; however, exact nature of these models have been lead to various limitations for essential simulation of these phenomena. in this research, traditional cellular automata models have been developed through fuzzy theory, in which, transition rules are expressed based on fuzzy logic control methodol...

complementary metal-oxide semiconductor (cmos) technology has been the industry standard to implement very large scale integrated (vlsi) devices for the last two decades. due to the consequences of miniaturization of such devices (i.e. increasing switching speeds, increasing complexity and decreasing power consumption), it is essential to replace them with a new technology. quantum-dot cellular...

This work shows that a class of pseudorandom binary sequences, the so-called interleaved sequences, can be generated by means of linear multiplicative polynomial cellular automata. In fact, these linear automata generate all the solutions of a type of linear difference equations with binary coefficients. Interleaved sequences are just particular solutions of such equations. In this way, popular...

This work shows that a wide class of cryptographic sequences, the so-called interleaved sequences, can be generated by means of linear multiplicative polynomial cellular automata. In fact, this type of onedimensional linear 90/150 cellular automata can be devised as generators of pseudo-random sequences. Moreover, these linear automata generate all the solutions of a type of difference equation...