ON DYNAMICAL BEHAVIORS OF CELLULAR AUTOMATA CA-60
نویسندگان
چکیده
منابع مشابه
Dynamical Behavior of Cellular Automata
Cellular Automata are simple computational models which can be leveraged to model a wide variety of dynamical systems. Composed of a lattice of discrete cells that take finite number of states based on previous iterations these models differ greatly from dynamic systems that vary continuously in space or time. However given their ability to model many of continuous systems, it could be postulat...
متن کاملA Modular Dynamical Cryptosystem Based on Continuous-Interval Cellular Automata
This paper presents a new cryptosystem based on chaotic continuous-interval cellular automata (CCA) to increase data protection as demonstrated by their flexibility to encrypt and decrypt information from distinct sources. Enhancements to cryptosystems are also presented including (i) a model based on a new chaotic CCA attractor, (ii) the dynamical integration of modules containing dynamical sy...
متن کاملThe Attractor Structure of Rule 60 Cellular Automata
The analysis of Rule 90 CA by Martin, Odlyzko and Wolfram using diploynomials over finite fields is extended to Rule 60 CA with odd cylinder size. Two classes of such CA are recognized. Their maximum attractor lengths and transients characteristics are given. The basic building block, from which the entire state space can be produced, is identified for each type. An application of the results f...
متن کاملClassification of CA Rules Targeting Synthesis of Reversible Cellular Automata
This paper reports classification of CA (cellular automata) rules targeting efficient synthesis of reversible cellular automata. An analytical framework is developed to explore the properties of CA rules for 3-neighborhood 1-dimensional CA. It is found that in two-state 3neighborhood CA, the CA rules fall into 6 groups depending on their potential to form reversible CA. The proposed classificat...
متن کاملGeneralized Partitioned Quantum Cellular Automata and Quantization of Classical CA
In this paper, in order to investigate natural transformations from discrete CA to QCA, we introduce a formulation of finite cyclic QCA and generalized notion of partitioned QCA. According to the formulations, we demonstratethe condition of local transition functions, which induce a global transition of well-formed QCA. Following the results, extending a natural correspondence of classical cell...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of informatics and cybernetics
سال: 1992
ISSN: 0286-522X
DOI: 10.5109/13420