Results 311 to 320 of about 1,658,666 (358)
Some of the next articles are maybe not open access.
An Energy-Aware Model for the Logic Synthesis of Quantum-Dot Cellular Automata
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2018Quantum-dot cellular automata (QCA) are an emerging field-coupled nanotechnology with remarkable performance and energy efficiency. In order to enable the exploration of this technology, we propose a model for the logic synthesis of QCA circuits that ...
Frank Sill Torres+3 more
semanticscholar +1 more source
Dimer automata and cellular automata
Physica D: Nonlinear Phenomena, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
K. P. Hadeler, B. Schöfisch
openaire +2 more sources
Journal of Organizational and End User Computing, 2017
Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to ...
Anil Kr. Upadhyay, Rupali Bhardwaj
openaire +2 more sources
Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to ...
Anil Kr. Upadhyay, Rupali Bhardwaj
openaire +2 more sources
Elementary Cellular Automata with Memory
Complex SystemsStandard cellular automata (CA) are ahistoric (memoryless), that is, the new state of a cell depends on the neighborhood configuration of only the preceding time step.
R. Alonso-Sanz, Margarita Martín
semanticscholar +1 more source
Cellular Automata And Complexity: Collected Papers
, 2019Primary Papers * Statistical Mechanics of Cellular Automata * Algebraic Properties of Cellular Automata * Universality and Complexity in Cellular Automata * Computation Theory of Cellular Automata * Undecidability and Intractability in Theoretical ...
S. Wolfram
semanticscholar +1 more source
Classification of Quantum Cellular Automata
Communications in Mathematical Physics, 2019There exists an index theory to classify strictly local quantum cellular automata in one dimension (Fidkowski et al. in Interacting invariants for Floquet phases of fermions in two dimensions, 2017. arXiv:1703.07360 ; Gross et al. in Commun Math Phys 310(
M. Freedman, M. Hastings
semanticscholar +1 more source
Cellular automata synchronization
Information Sciences, 1976The first part of this paper deals with the Firing Squad Synchronization problem extended to networks however connected. A new class of configurations called "flower graphs" is presented whose synchronization is useful to reduce synchronization time for any graph. The second part investigates the lower bounds for synchronization time from a theoretical
openaire +5 more sources
Statistical mechanics of cellular automata
, 1983Cellular automata are used as simple mathematical models to investigate self-organization in statistical mechanics. A detailed analysis is given of ''elementary'' cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each
S. Wolfram
semanticscholar +1 more source
Nontrivial Quantum Cellular Automata in Higher Dimensions
Communications in Mathematical Physics, 2018We construct a three-dimensional quantum cellular automaton (QCA), an automorphism of the local operator algebra on a lattice of qubits, which disentangles the ground state of the Walker–Wang three-fermion model.
Jeongwan Haah, L. Fidkowski, M. Hastings
semanticscholar +1 more source
Physics Letters A, 1992
Abstract We present a general procedure to associate hierarchies of cellular automata with given spectral problems choosing, as illustrative example, the discrete Schrodinger problem. For these cellular automata we construct a countable number of constants of motion using standard spectral techniques and we perform numerical experiments showing ...
BRUSCHI, Mario+2 more
openaire +4 more sources
Abstract We present a general procedure to associate hierarchies of cellular automata with given spectral problems choosing, as illustrative example, the discrete Schrodinger problem. For these cellular automata we construct a countable number of constants of motion using standard spectral techniques and we perform numerical experiments showing ...
BRUSCHI, Mario+2 more
openaire +4 more sources