Results 21 to 30 of about 6,248 (262)

Post-surjectivity and balancedness of cellular automata over groups [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2017
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

Blackouts Mechanism Simulation Model of Power System Based on Heterogeneous Cellular Automata

open access: yesZhongguo dianli, 2019
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

Zip cellular automata [PDF]

open access: yesAIP Advances
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]

open access: yesE3S Web of Conferences, 2021
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

Elementary Cellular Automata as Invariant under Conjugation Transformation or Combination of Conjugation and Reflection Transformations, and Applications to Traffic Modeling

open access: yesMathematics, 2022
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

On “forgetful” cellular automata

open access: yesJournal of Computer and System Sciences, 1975
Cellular automata are modified in such a way that states of a single automaton become unreachable if they have not been rereached during a certain period depending on a function : The automaton then will assume the quiescent state. These “forgetful” cellular automata may differ with respect to the function , the scheme by which the automata are ...
W. O. Höllerer, Roland Vollmar
openaire   +2 more sources

Ratchet Cellular Automata [PDF]

open access: yesPhysical Review Letters, 2003
In this work we propose a ratchet effect which provides a general means of performing clocked logic operations on discrete particles, such as single electrons or vortices. The states are propagated through the device by the use of an applied AC drive. We numerically demonstrate that a complete logic architecture is realizable using this ratchet.
Hastings, M. B.   +2 more
openaire   +3 more sources

Dynamic Path Planning for Mobile Robots with Cellular Learning Automata

open access: yesJournal of ICT Research and Applications, 2016
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

Block cipher based on T-shaped cellular automata

open access: yesTongxin xuebao, 2009
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

Plasmonic Nanostructured Cellular Automata

open access: yesEPJ Web of Conferences, 2017
In this work, we have investigated the scattering plasmonic resonance characteristics of silver nanospheres with a geometrical distribution that is modelled by Cellular Automata using time-domain numerical analysis.
Alkhazraji Emad   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy