On the limit sets of cellular automata
SIAM Journal on Computing
Sequential Machines: Selected Papers
Sequential Machines: Selected Papers
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
Regular Article: The surjectivity problem for 2D cellular automata
Proceedings of the 30th IEEE symposium on Foundations of computer science
A brief history of cellular automata
ACM Computing Surveys (CSUR)
Theoretical Computer Science
Algorithmic Information Theory and Cellular Automata Dynamics
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
The Intrinsic Universality Problem of One-Dimensional Cellular Automata
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Linear Cellular Automata with Multiple State Variables
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Tilings: Recursivity and Regularity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On computing the entropy of cellular automata
Theoretical Computer Science
Number-conserving cellular automata I: decidability
Theoretical Computer Science
Number conserving cellular automata II: dynamics
Theoretical Computer Science
Tilings: recursivity and regularity
Theoretical Computer Science
On the size of the inverse neighborhoods for one-dimensional reversible cellular automata
Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
Theory of cellular automata: a survey
Theoretical Computer Science
A new dimension sensitive property for cellular automata
Theoretical Computer Science - Mathematical foundations of computer science 2004
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
Fast reversible language recognition using cellular automata
Information and Computation
Topological Dynamics of 2D Cellular Automata
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Decidable Properties of 2D Cellular Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Perfectly quilted rectangular snake tilings
Theoretical Computer Science
The 4-way deterministic tiling problem is undecidable
Theoretical Computer Science
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
A Cryptosystem Based on the Composition of Reversible Cellular Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
About the Garden of Eden Theorems for Cellular Automata in the Hyperbolic Plane
Electronic Notes in Theoretical Computer Science (ENTCS)
Real-time reversible iterative arrays
Theoretical Computer Science
Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Infinite snake tiling problems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
The most general conservation law for a cellular automaton
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
DLT'10 Proceedings of the 14th international conference on Developments in language theory
An algorithmic approach to tilings of hyperbolic spaces: 10 years later
CMC'10 Proceedings of the 11th international conference on Membrane computing
Towards a neighborhood simplification of tile systems: From Moore to quasi-linear dependencies
Natural Computing: an international journal
Theoretical Computer Science
Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders
Electronic Notes in Theoretical Computer Science (ENTCS)
Snakes and cellular automata: reductions and inseparability results
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Linear algebra based bounds for one-dimensional cellular automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Reversible conservative rational abstract geometrical computation is turing-universal
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
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
On time-symmetry in cellular automata
Journal of Computer and System Sciences
Non-uniform cellular automata: Classes, dynamics, and decidability
Information and Computation
Groups, graphs, languages, automata, games and second-order monadic logic
European Journal of Combinatorics
Computational complexity of rule distributions of non-uniform cellular automata
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
On the Circuit Depth of Structurally Reversible Cellular Automata
Fundamenta Informaticae
From One-dimensional to Two-dimensional Cellular Automata
Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
Real-time reversible iterative arrays
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Cellular automata on regular rooted trees
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
RC'13 Proceedings of the 5th international conference on Reversible Computation
Cellular automata between sofic tree shifts
Theoretical Computer Science
Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
Theoretical Computer Science
m-Asynchronous cellular automata: from fairness to quasi-fairness
Natural Computing: an international journal
| Hi-index | 0.01 |
The problem of deciding if a given cellular automaton (CA) is reversible (or, equivalently, if its global transition function is injective) is called the reversibility problem of CA. In this article we show that the reversibility problem is undecidable in case of two-dimensional CA. We also prove that the corresponding surjectivity problem-the problem of deciding if the global function is surjective-is undecidable for two-dimensional CA. Both problems are known to be decidable in case of one-dimensional CA. The proofs of the theorems are based on reductions from the well-known tiling problem of the plane, known also as the domino problem.