The surjectivity problem for 2D cellular automata
作者:
Highlights:
•
摘要
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.
论文关键词:
论文评审过程:Received 22 February 1993, Revised 9 June 1993, Available online 19 August 2005.
论文官网地址:https://doi.org/10.1016/S0022-0000(05)80077-7