Results 1 to 10 of about 1,625,467 (160)
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
Nominal Cellular Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 The emerging field of Nominal Computation Theory is concerned with the theory of Nominal Sets and its applications to Computer Science. We investigate here the impact of nominal sets on the definition of Cellular Automata and on their computational ...
Tommaso Bolognesi, Vincenzo Ciancia
doaj +7 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
Randomized Cellular Automata [PDF]
International Journal of Modern Physics C, 2007 We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined on random ...
Boccara N., NINO BOCCARA
core +3 more sources
Fluxonic Cellular Automata [PDF]
Applied Physics Letters, 2007 We formulate a new concept for computing with quantum cellular automata composed of arrays of nanostructured superconducting devices. The logic states are defined by the position of two trapped flux quanta (vortices) in a 2x2 blind-hole-matrix etched on ...
Berdiyorov, G. R. +2 more
core +5 more sources
On algebraic cellular automata [PDF]
Journal of the London Mathematical Society, 2011 We investigate some general properties of algebraic cellular automata, i.e., cellular automata over groups whose alphabets are affine algebraic sets and which are locally defined by regular maps.
Ceccherini-Silberstein, Tullio +1 more
core +4 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
Quantum Cellular Automata [PDF]
, 2008 Quantum cellular automata (QCA) are reviewed, including early and more recent proposals. QCA are a generalization of (classical) cellular automata (CA) and in particular of reversible CA. The latter are reviewed shortly.
Wiesner, K.
core +4 more sources
Ratchet Cellular Automata [PDF]
Physical Review Letters, 2002 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
C. Buzea +6 more
core +4 more sources
Predictability in cellular automata. [PDF]
PLoS ONE, 2014 Modelled as finite homogeneous Markov chains, probabilistic cellular automata with local transition probabilities in (0, 1) always posses a stationary distribution. This result alone is not very helpful when it comes to predicting the final configuration;
Alexandru Agapie +3 more
doaj +5 more sources