Formal languages and their relation to automata
Formal languages and their relation to automata
Reversibility and surjectivity problems of cellular automata
Journal of Computer and System Sciences
Group structured linear cellular automata over Zm
Journal of Computer and System Sciences
Regular Article: The surjectivity problem for 2D cellular automata
Proceedings of the 30th IEEE symposium on Foundations of computer science
Linear Cellular Automata with Multiple State Variables
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A tight linear bound on the synchronization delay of bijective automata
Theoretical Computer Science
Hybrid one-dimensional reversible cellular automata are regular
Discrete Applied Mathematics
Reversible computing and cellular automata—A survey
Theoretical Computer Science
When–and how–can a cellular automaton be rewritten as a lattice gas?
Theoretical Computer Science
Induced Subshifts and Cellular Automata
Language and Automata Theory and Applications
Information and Computation
Reproduction in tessellation structures
Journal of Computer and System Sciences
On reversibility in cellular automata
Journal of Computer and System Sciences
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
Journal of Computer and System Sciences
Theoretical Computer Science
Theoretical Computer Science
A tight linear bound on the neighborhood of inverse cellular automata
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
How does the neighborhood affect the global behavior of cellular automata?
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
A protocol to provide assurance of images integrity using memory cellular automata
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Continuous relations and richardson's theorem
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Cellular automata between sofic tree shifts
Theoretical Computer Science
| Hi-index | 0.01 |
Local transformations operating in a tessellated n-dimensional space are characterized by conditions of continuity and translation invariance. Nondeterministic as well as deterministic transformations are discussed. Populations of configurations which can be derived from an initial configuration using a nondeterministic transformation are considered and the analogy with linguistics is stressed. The Garden of Eden theorem plus compactness of the product topology is used to obtain the following: It a local transformation is a one-to-one function, it must also be onto and have a local inverse. Infinite as well as finite configurations are allowed in the domain of a local transformation.