Results 1 to 10 of about 81,730 (310)
Cellular Automata are Generic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 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 +7 more sources
Cities and cellular automata [PDF]
Discrete Dynamics in Nature and Society, 1998 Cellular automata provide a high-resolution representation of urban spatial dynamics.Consequently they give the most realistic predictions of urban structural evolution, and in particular they are able to replicate the various fractal dimensionalities of
Roger White
doaj +5 more sources
Phase Space Invertible Asynchronous Cellular Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata.
Simon Wacker, Thomas Worsch
doaj +4 more sources
Intrinsic Simulations between Stochastic Cellular Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 The paper proposes a simple formalism for dealing with deterministic, non-deterministic and stochastic cellular automata in a unifying and composable manner.
Pablo Arrighi +2 more
doaj +6 more sources
Representing Reversible Cellular Automata with Reversible Block Cellular Automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 Cellular automata are mappings over infinite lattices such that each cell is updated according tothe states around it and a unique local function.Block permutations are mappings that generalize a given permutation of blocks (finite arrays of fixed size ...
Jérôme Durand-Lose
doaj +4 more sources
Post-surjectivity and balancedness of cellular automata over groups [PDF]
Discrete 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 +4 more sources
Freezing, Bounded-Change and Convergent Cellular Automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 This paper studies three classes of cellular automata from a computational point of view: freezing cellular automata where the state of a cell can only decrease according to some order on states, cellular automata where each cell only makes a bounded ...
Nicolas Ollinger, Guillaume Theyssier
doaj +1 more source
The reversibility of one-dimensional cellular automata
RUDN Journal of Engineering Research, 2021 Recently the reversible cellular automata are increasingly used to build high-performance cryptographic algorithms. The paper establishes a connection between the reversibility of homogeneous one-dimensional binary cellular automata of a finite size and ...
Alexey E. Zhukov
doaj +1 more source
Model of cellular automata [PDF]
Компьютерные исследования и моделирование, 2010 An introduction to the models of cellular automata is given. The three automata described on the plane are: Viner-Rosenbluth cellular automata, the game of Life and Kohomoto-Oono automata for modelling «reaction-diffusion» systems.
Alexey I. Lobanov
doaj +1 more source
A note on cellular automata [PDF]
Advances in Group Theory and Applications, 2021 In this note, we give a new totally topological definition of cellular automata over groups. We show that every continuous self-map of the shift space A^G can be represented as a G-sequence of cellular automata. In the case of a finitely generated group
Mohammad Shahryari
doaj +1 more source