Cellular automata machines: a new environment for modeling
Cellular automata machines: a new environment for modeling
Ininvertible cellular automata: a review
Physica D
Decidability for some problems of linear cellular automata over finite commutative rings
Information Processing Letters
Reversibility and surjectivity problems of cellular automata
Journal of Computer and System Sciences
Invertible linear cellular automata over Zm: algorithmic and dynamical aspects
Journal of Computer and System Sciences
A computational theory of laurent polynomial rings and multidimensional fir systems
A computational theory of laurent polynomial rings and multidimensional fir systems
Tessellations with local transformations
Journal of Computer and System Sciences
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
Journal of Computer and System Sciences
On the realizability of biorthogonal, m-dimensional two-band filterbanks
IEEE Transactions on Signal Processing
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
On shift spaces with algebraic structure
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
| Hi-index | 0.00 |
We investigate a finite state analog of subband coding, based on linear Cellular Automata with multiple state variables. We show that such a CA is injective (surjective) if and only if the determinant of its transition matrix is an injective (surjective, respectively) single variable automaton.We prove that in the one-dimensional case every injective automaton can be factored into a sequence of elementary automata, defined by elementary transition matrices. Finally, we investigate the factoring problem in higher dimensional spaces.