Cellular Automata vs. Quasisturmian Shifts
نویسندگان
چکیده
If L = Z and A is a finite set, then AL is a compact space; a cellular automaton (CA) is a continuous transformation Φ : AL−→AL that commutes with all shift maps. A quasisturmian (QS) subshift is a shift-invariant subset obtained by mapping the trajectories of an irrational torus rotation through a partition of the torus. The image of a QS shift under a CA is again QS. We study the topological dynamical properties of CA restricted to QS shifts, and compare them to the properties of CA on the full shift AL. We investigate injectivity, surjectivity, transitivity, expansiveness, rigidity, fixed/periodic points, and invariant measures. We also study ‘chopping’: how iterating the CA fragments the partition generating the QS shift. MSC: 37B15 (primary), 68Q80 (secondary)
منابع مشابه
Cellular Automata on Regular Rooted Trees
We study cellular automata on regular rooted trees. This includes the characterization of sofic tree shifts in terms of unrestricted Rabin automata and the decidability of the surjectivity problem for cellular automata between sofic tree shifts.
متن کاملCellular automata between sofic tree shifts
We study the sofic tree shifts of A ∗ , where Σ∗ is a regular rooted tree of finite rank. In particular, we give their characterization in terms of unrestricted Rabin automata. We show that if X ⊂ A ∗ is a sofic tree shift, then the configurations in X whose orbit under the shift action is finite are dense in X , and, as a consequence of this, we deduce that every injective cellular automata τ ...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملImproved Frog Leaping Algorithm Using Cellular Learning Automata
In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...
متن کاملDesign of low power random number generators for quantum-dot cellular automata
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...
متن کامل