Results 301 to 310 of about 1,932,334 (359)
Some of the next articles are maybe not open access.
Acta Applicandae Mathematicae, 2013
This paper is devoted to the study of so-called permutation cellular automata (CAs), especially their dynamics. More specifically, it extends one-sided permutation CAs that were studied before by two of this paper's authors and introduces the formalism that is required to analyze the dynamics of one- and two-sided permutation CAs. By reading this paper,
Jadur, Camilo +2 more
openaire +1 more source
This paper is devoted to the study of so-called permutation cellular automata (CAs), especially their dynamics. More specifically, it extends one-sided permutation CAs that were studied before by two of this paper's authors and introduces the formalism that is required to analyze the dynamics of one- and two-sided permutation CAs. By reading this paper,
Jadur, Camilo +2 more
openaire +1 more source
Markov chains and cellular automata to predict environments subject to desertification.
Journal of Environmental Management, 2018The foremost objective of this study was to analyze the performance of a Markov chain/cellular automata model for predicting land use/land cover changes in environments predisposed to desertification.
Kelly de Oliveira Barros +7 more
semanticscholar +1 more source
Hierarchical Cellular Automata for Visual Saliency
International Journal of Computer Vision, 2017Saliency detection, finding the most important parts of an image, has become increasingly popular in computer vision. In this paper, we introduce Hierarchical Cellular Automata (HCA)—a temporally evolving model to intelligently detect salient objects ...
Yao Qin +3 more
semanticscholar +1 more source
Cellular Automata and Agent-Based Models
Handbook of Regional Science, 2021K. Clarke
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
Programming and Computer Software, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +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 +3 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 +3 more sources
Simulating 3D Cellular Automata with 2D Cellular Automata
2004The purpose of this article is to describe a way to simulate any 3-dimensional cellular automaton with a 2-dimensional cellular automaton. We will present the problems that arise when changing the dimension, propose solutions and discuss the main properties of the obtained simulation.
openaire +1 more source
A robust image encryption scheme using chaotic tent map and cellular automata
Nonlinear dynamics, 2020Prabir Kumar Naskar +3 more
semanticscholar +1 more source
Linear cellular automata and Fischer automata
Parallel Computing, 1997We study the sizes of minimal finite state machines associated with linear cellular automata. In particular, we construct a class of binary linear cellular automata whose corresponding minimal automata exhibit full exponential blow-up. These cellular automata have Hamming distance 1 to a permutation automaton.
openaire +1 more source