Results 51 to 60 of about 1,667,734 (380)
Early Warning Signals for Critical Transitions in Sandpile Cellular Automata
The sandpile cellular automata, despite the simplicity of their basic rules, are adequate mathematical models of real-world systems, primarily open nonlinear systems capable to self-organize into the critical state.
Andrey Dmitriev+4 more
doaj +1 more source
A Cellular Automata Fast Flood Evaluation (CA‐ffé) Model
The simulation speed of two‐dimensional hydrodynamic flood models is a limiting factor when catchments are large, a considerable number of simulations is required (e.g., exploratory modeling, Monte‐Carlo flood simulations, or predicting probabilistic ...
B. Jamali+3 more
semanticscholar +1 more source
A Linear Acceleration Theorem for 2D Cellular Automata on all Complete Neighborhoods [PDF]
Linear acceleration theorems are known for most computational models. Although such results have been proved for two-dimensional cellular automata working on specific neighborhoods, no general construction was known. We present here a technique of linear acceleration for all two-dimensional languages recognized by cellular automata working on complete ...
arxiv +1 more source
Block cipher based on T-shaped cellular automata
In order to overcome the defect on insecurity of block cipher with few reversible cellular automata, T-shaped cellular automata was proposed, which needed two initial states and applied their characteristics to construct more re-versible cellular ...
WU Ying-zhi1, HAO Li-bo2, CHEN Ju-hua1
doaj +2 more sources
Pemodelan Evakuasi Pejalan Kaki di Ruang Koridor dengan Cellular Automata Studi Kasus Gempa Bumi
Pemodelan Sistem Evakuasi Pejalan Kaki adalah sebuah sistem pemodelan untuk memodelkan pergerakan objek manusia untuk memberikan analisis pada kejadian evakuasi dalam studi kasus bencana Gempa Bumi.
Muarifin Muarifin+2 more
doaj +1 more source
This paper develops the analysis of properties of the cellular automata class introduced by the authors. It is assumed that the set of automaton cells is finite and forms a closed lattice, and there are two states for each automaton cell.
Valery Kozlov+2 more
doaj +1 more source
Intrinsically Universal Cellular Automata [PDF]
This talk advocates intrinsic universality as a notion to identify simple cellular automata with complex computational behavior. After an historical introduction and proper definitions of intrinsic universality, which is discussed with respect to Turing ...
Nicolas Ollinger
doaj +1 more source
On the classifiability of cellular automata
Based on computer simulations Wolfram presented in several papers conjectured classifications of cellular automata into 4 types. He distinguishes the 4 classes of cellular automata by the evolution of the pattern generated by applying a cellular automaton to a finite input.
Saharon Shelah, John T. Baldwin
openaire +3 more sources
In this paper, the properties of the classical confusion–substitution structure and some recently proposed pseudorandom number generators using one-dimensional chaotic maps are investigated.
Wei Zhang, Zhiliang Zhu, Hai Yu
semanticscholar +1 more source
Expressiveness of Elementary Cellular Automata [PDF]
We investigate expressiveness, a parameter of one-dimensional cellular automata, in the context of simulated biological systems. The development of elementary cellular automata is interpreted in terms of biological systems, and biologically inspired parameters for biodiversity are applied to the configurations of cellular automata.
arxiv +1 more source