In th is paper we propos e a method for generating fract al patterns using "classical" cellular automata. Although the prob lem of fractal generat ion for linear cellular automata has been st udied recently, this is not t he case for classical cellular automata. We first exhibit some basic techniques for the construction of the tr ansit ion function , which draws a Cantor set, and show how this...

Cellular automata are mappings over infinite lattices such that each cell is updated according to the states around it and a unique local function. Block permutations are mappings that generalize a given permutation of blocks (finite arrays of fixed size) to a given partition of the lattice in blocks. We prove that any d-dimensional reversible cellular automaton can be expressed as the composit...

Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA.  Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...

A new method for estimating the glitching contribution to the power dissipation of multilevel combinational logic circuits based on complex-time cellular automata is presented for the first time. To bridge the gap between continuous time, in which the combinational logic circuits operate, and the discrete time, in which cellular automata operate, the concept of complex time is introduced. Both ...

Quantum dot cellular automata (QCA) introduces a pioneer technology in nano scale computer architectures. Employing this technology is one of the solutions to decrease the size of circuits and reducing power dissipation. In this paper, two new optimized FlipFlops with reset input are proposed in quantum dot cellular automata technology. In addition, comparison with related works is performed.Th...

Defining the density flow of perturbations moving at a given speed for cellular automata, we establish equalities and inequalities between the measurable entropy of a cellular automaton and the measurable entropy of its associated shift. We illustrate our results by different examples and we study some relations between the density flow (with respect to a linear or a sublinear speed) and some p...