THE SURJECTIVITY PROBLEM FOR 2D CELLULAR-AUTOMATA

被引：14
|
作者：
DURAND, B
机构：
[1] Laboratoire de l’Informatique du Parallélisme, ENS-Lyon, 69364 Lyon 07
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1994年 / 49卷 / 03期
关键词：
D O I：
10.1016/S0022-0000(05)80077-7
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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. (C) 1994 Academic Press, Inc.
引用
收藏
页码：718 / 725
页数：8
相关论文
共 50 条
12345