Inversion of 2D cellular automata: some complexity results
Theoretical Computer Science
Nonconstructible blocks in 1D cellular automata: minimal generators and natural systems
Applied Mathematics and Computation
Cryptography: Theory and Practice,Second Edition
Cryptography: Theory and Practice,Second Edition
Comments on "Theory and Applications of Cellular Automata in Cryptography"
IEEE Transactions on Computers
Matrix algebraic formulae concerning some exceptional rules of two-dimensional cellular automata
Information Sciences: an International Journal
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
On cellular automata over Galois rings
Information Processing Letters
A multisecret sharing scheme for color images based on cellular automata
Information Sciences: an International Journal
On behavior of two-dimensional cellular automata with an exceptional rule
Information Sciences: an International Journal
Some clarifications of the concept of a Garden-of-Eden configuration
Journal of Computer and System Sciences
Structure and reversibility of 2D hexagonal cellular automata
Computers & Mathematics with Applications
| Hi-index | 0.07 |
An important problem in cellular automata theory is the reversibility of a cellular automaton which is related to the existence of Garden of Eden configurations in cellular automata. In this paper, we study new local rules for two-dimensional cellular automata over the ternary field Z"3 (the set of integers modulo three) with some of their important characteristics. We obtain necessary and sufficient conditions for the existence of Garden of Eden configurations for two-dimensional ternary cellular automata. Also by making use of the matrix representation of two-dimensional cellular automata, we provide an algorithm to obtain the number of Garden of Eden configurations for two-dimensional cellular automata defined by rule 2460N. We present an application of the reversible two-dimensional ternary cellular automata to cryptography.