Deterministic cellular automata resembling diffusion
نویسندگان
چکیده
In this paper, we investigate number-conserving cellular automata with up to five inputs and two states the goal of comparing their dynamics diffusion. For purpose, introduce concept decompression ratio describing expansion configurations finite support. We find that a large number rules exhibit abrupt change in when density initial pattern is increasing, somewhat analogous second-order phase transition. The existence transition formally proved for rule 184. Small infinite ratio, such may be useful “engineering” CA which are good models diffusion, although they will most likely require more than states.
منابع مشابه
Voter Dynamics in Deterministic Cellular Automata
A deterministic counterpart is introduced to the voter model studied in probabilistic particle systems. Here we investigate the ingredients of the rule as well as its annealing domain dynamics. It is a representative from a larger class of cellular automata with the common property that they all show behavior previously associated to lattice models with strong independence assumptions. The resu...
متن کاملEvolving Deterministic Finite Automata Using Cellular Encoding
This paper presents a method for the evolution of deterministic finite automata that combines genetic programming and cellular encoding. Programs are evolved that specify actions for the incremental growth of a deterministic finite automata from an initial single-state zygote. The results show that, given a test bed of positive and negative samples, the proposed method is successful at inducing...
متن کاملCellular Automata Simulation of a Bistable Reaction-Diffusion System: Microscopic and Macroscopic Approaches
The Cellular Automata method has been used to simulate the pattern formation of the Schlögl model as a bistable Reaction-Diffusion System. Both microscopic and macroscopic Cellular Automata approaches have been considered and two different methods for obtaining the probabilities in the microscopic approach have been mentioned. The results show the tendency of the system towards the more sta...
متن کاملCellular Automata for Reaction Diffusion Systems
A class of cellular automata for reaction-diiusion systems is presented. It is based on a local average for the diiusive dynamics, and closely related to nite diierence schemes. The reactive dynamics is implemented as a lookup-table with probabilistic rules. The rules are derived directly and systematically from the given diierential equations, using probabilistic rounding to enforce the discre...
متن کاملCellular Automata Models for Diffusion of Innovations
We propose a probabilistic cellular automata model for the spread of innovations, rumors, news, etc. in a social system. The local rule used in the model is outertotalistic, and the range of interaction can vary. When the range R of the rule increases, the takeover time for innovation increases and converges toward its mean-field value, which is almost inversely proportional to R when R is larg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics C
سال: 2022
ISSN: ['0129-1831', '1793-6586']
DOI: https://doi.org/10.1142/s0129183122501480