Results 11 to 20 of about 81,730 (310)
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
Control of cellular automata [PDF]
Physical Review E, 2012 We study the problem of master-slave synchronization and control of totalistic cellular automata (CA) by putting a fraction of sites of the slave equal to those of the master and finding the distance between both as a function of this fraction.
A. B. Mingarelli +9 more
core +8 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
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
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
Communications in cellular automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic problems ranging from the complexity of predicting to the decidability of ...
Guillaume Theyssier +3 more
doaj +6 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
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
On reversibility in cellular automata
Journal of Computer and System Sciences, 1975 The notion of reversibility, or backward determinism, for cellular automata is investigated. Various intuitively different definitions are offered which coalesce in three inequivalent properties. Two of these are the well-known injectivity and surjectivity properties of the global transition function of a cellular automaton.
Salvatore Di Gregorio +1 more
openalex +3 more sources