Results 11 to 20 of about 928 (215)
On a periodic soliton cellular automaton [PDF]
We propose a box and ball system with a periodic boundary condition (pBBS). The time evolution rule of the pBBS is represented as a Boolean recurrence formula, an inverse ultradiscretization of which is shown to be equivalent with the algorithm of the calculus for the 2Nth root. The relations to the pBBS of the combinatorial R matrix of ${U'}_q(A_N^{(1)
Yura, Fumitaka, Tokihiro, Tetsuji
openaire +3 more sources
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
Modeling and analyzing malware diffusion in wireless sensor networks based on cellular automaton
Wireless sensor networks, as a multi-hop self-organized network system formed by wireless communication, are vulnerable to malware diffusion by breaking the data confidentiality and service availability, owing to their low configuration and weak defense ...
Hong Zhang +4 more
doaj +1 more source
Cellular Automata are Generic [PDF]
Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular automaton ...
Nachum Dershowitz, Evgenia Falkovich
doaj +1 more source
A quantum Samaritan’s dilemma cellular automaton [PDF]
The dynamics of a spatial quantum formulation of the iterated Samaritan’s dilemma game with variable entangling is studied in this work. The game is played in the cellular automata manner, i.e. with local and synchronous interaction. The game is assessed
Ramón Alonso-Sanz, Haozhen Situ
doaj +1 more source
Cellular automaton-based simulation of bulk stacking and recovery
Stockpiling is a key issue in bulk material handling. A small-scale, quasi-two-dimensional physical model was used to investigate size segregation during stacking and gravitational reclaim of stockpiles and to compare experimental results to those ones ...
Matheus Henrique de Castro +2 more
doaj +1 more source
Transductions Computed by One-Dimensional Cellular Automata [PDF]
Cellular automata are investigated towards their ability to compute transductions, that is, to transform inputs into outputs. The families of transductions computed are classified with regard to the time allowed to process the input and to compute the ...
Martin Kutrib, Andreas Malcher
doaj +1 more source
An approach to multiscale description of deformation and fracture of brittle porous materials on the basis of movable cellular automaton method was proposed.
Ig. S. Konovalenko +2 more
doaj +3 more sources
A cellular automaton for blocking queen games [PDF]
We show that the winning positions of a certain type of two-player game form interesting patterns which often defy analysis, yet can be computed by a cellular automaton. The game, known as {\em Blocking Wythoff Nim}, consists of moving a queen as in chess, but always towards (0,0), and it may not be moved to any of $k-1$ temporarily "blocked" positions
Matthew Cook 0001 +2 more
openaire +5 more sources

