Results 11 to 20 of about 17,728 (274)
A parallel block-based encryption schema for digital images using reversible cellular automata
We propose a novel images encryption schema based on reversible one-dimensional cellular automata. Contrasting to the sequential operating mode of several existing approaches, the proposed one is fully parallelizable since the encryption/decryption tasks
Faraoun Kamel Mohamed
doaj +3 more sources
Bounded Languages Meet Cellular Automata with Sparse Communication [PDF]
Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell communication by ...
A. Klein +27 more
core +2 more sources
Limit sets of stable Cellular Automata [PDF]
We study limit sets of stable cellular automata standing from a symbolic dynamics point of view where they are a special case of sofic shifts admitting a steady epimorphism.
Alexis Ballier, Santiago Chile
core +1 more source
BLOCK TRANSFORMATION OF HYBRID CELLULAR AUTOMATA
Summary: By introducing a sequence-block transformation and vector-block transformation, we explore the dynamical properties of hybrid cellular automation (HCA) and hybrid cellular automation with memory (HCAM) in the framework of symbolic dynamics. As the local evolution rules of HCA and HCAM are not-uniform, the new uniform cellular automata (CAs ...
Chen, Bo +3 more
openaire +2 more sources
Statistical analysis of Margoluss block-rotating mechanism cellular automation modeling the diffusion in a medium with discrete singularities [PDF]
The generalization of Margoluss block cellular automaton on a hexagonal grid is formulated. Statistical analysis of the results of probabilistic cellular automation for vast variety of this scheme solving the test task of diffusion is done.
Sergey Vital'evich Gavrilov +1 more
doaj +1 more source
Undecidable Properties of Limit Set Dynamics of Cellular Automata [PDF]
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A well know result, due to Kari, says that all nontrivial properties of limit
Di Lena, Pietro, Margara, Luciano
core +3 more sources
Topological properties of cellular automata on trees [PDF]
We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity ...
Acerbi +22 more
core +5 more sources
Directed percolation in nonunitary quantum cellular automata
Probabilistic cellular automata (CA) provide a classic framework for studying nonequilibrium statistical physics on lattices. A notable example is the Domany-Kinzel CA, which has been used to investigate the process of directed percolation and the ...
Ramil Nigmatullin +2 more
doaj +1 more source
Intrinsic Universality in Self-Assembly [PDF]
We show that the Tile Assembly Model exhibits a strong notion of universality where the goal is to give a single tile assembly system that simulates the behavior of any other tile assembly system.
Doty, David +4 more
core +7 more sources
Superintegrable cellular automata and dual unitary gates from Yang-Baxter maps
We consider one dimensional block cellular automata, where the local update rules are given by Yang-Baxter maps, which are set theoretical solutions of the Yang-Baxter equations.
Tamás Gombor, Balázs Pozsgay
doaj +1 more source

