Regular Article
The surjectivity problem for 2D cellular automata*

https://doi.org/10.1016/S0022-0000(05)80077-7Get rights and content
Under an Elsevier user license
open archive

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.

Cited by (0)

*

This work was partially supported by the Esprit Basic Research Action “Algebraic and Syntactic Methods In Computer Science” and by the PRC “Mathématique et Informatique.”

Copyright © 1994 Published by Elsevier Inc.