Results 21 to 30 of about 1,249,762 (237)
Strictly Temporally Periodic Points in Cellular Automata [PDF]
We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not spatially periodic.
Alberto Dennunzio +2 more
doaj +1 more source
Post-surjectivity and balancedness of cellular automata over groups [PDF]
We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other.
Silvio Capobianco +2 more
doaj +1 more source
Configurable cellular automata for pseudorandom number generation [PDF]
This paper proposes a generalized structure of cellular automata (CA) – the configurable cellular automata (CoCA). With selected properties from programmable CA (PCA) and controllable CA (CCA), a new approach to cellular automata is developed.
Guan, SU +3 more
core +1 more source
Blackouts Mechanism Simulation Model of Power System Based on Heterogeneous Cellular Automata
In order to study the mechanism of large blackouts of interconnected power system, a heterogeneous cellular automata model is proposed and used to simulate interconnected power system.
Qun YU, Qi WANG, Na CAO
doaj +1 more source
In this study, the one-dimensional cellular automaton is extended to one that involves two sets of symbols and two local rules. As a main result, a characterization theorem is provided.
Pouya Mehdipour +2 more
doaj +1 more source
Cellular-automaton modeling of gas sorption kinetics in the finite volume of coal [PDF]
The work is devoted to cellular-automaton modeling based on a class of cellular automata with Margolus neighborhood. Modeling of the gas sorption process by coal particle was carried out.
Nemtsev Aleksander +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
Dynamic Path Planning for Mobile Robots with Cellular Learning Automata
In this paper we propose a new approach to path planning for mobile robots with cellular automata and cellular learning automata. We divide the planning into two stages.
Judhi Santoso +2 more
doaj +1 more source
Layered cellular automata for pseudorandom number generation [PDF]
The proposed Layered Cellular Automata (L-LCA), which comprises of a main CA with L additional layers of memory registers, has simple local interconnections and high operating speed. The time-varying L-LCA transformation at each clock can be reduced to a
Guan, SU, Tan, SK
core +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

