On the limit sets of cellular automata
SIAM Journal on Computing
Ininvertible cellular automata: a review
Physica D
Reversibility and surjectivity problems of cellular automata
Journal of Computer and System Sciences
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
Algorithmic Information Theory and Cellular Automata Dynamics
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Tilings: Recursivity and Regularity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Number-conserving cellular automata I: decidability
Theoretical Computer Science
Tilings: recursivity and regularity
Theoretical Computer Science
A new dimension sensitive property for cellular automata
Theoretical Computer Science - Mathematical foundations of computer science 2004
Infinite snake tiling problems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Snakes and cellular automata: reductions and inseparability results
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Basic properties for sand automata
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
From One-dimensional to Two-dimensional Cellular Automata
Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
| Hi-index | 0.00 |
The surjectivity problem for 2D cellular automata was proved undecidable in 1989 by Jarkko Kari. The proof consists in a reduction of a problem concerning finite tilings into the previous one. This reduction uses a special and very sophisticated tile set. In this article, we present a much more simple tile set which can play the same role.