Decidability and undecidability in cellular automata

被引：7
|
作者：
Kari, Jarkko [1 ]
机构：
[1] Univ Turku, Dept Math, FI-20014 Turku, Finland
来源：
INTERNATIONAL JOURNAL OF GENERAL SYSTEMS | 2012年 / 41卷 / 06期
基金：
芬兰科学院;
关键词：
cellular automata; undecidability; tiling problem; APERIODIC SET; LIMIT-SETS; ENTROPY; REVERSIBILITY; SENSITIVITY;
D O I：
10.1080/03081079.2012.695895
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We survey results on decidability questions concerning cellular automata. Properties discussed include reversibility and surjectivity and their variants, time-symmetry and conservation laws, nilpotency and other properties of the limit set and the trace, properties chaoticity related such as sensitivity to initial conditions and mixing of the space, and dynamics from finite initial configurations. We also discuss briefly the tiling problem and its variants, and consider the influence of the dimension of the space on the decidability status of the questions.
引用
收藏
页码：539 / 554
页数：16
相关论文
共 50 条
  • [21] Non-uniform cellular automata: Classes, dynamics, and decidability
    Dennunzio, Alberto
    Formenti, Enrico
    Provillard, Julien
    INFORMATION AND COMPUTATION, 2012, 215 : 32 - 46
  • [22] Undecidability and Finite Automata
    Endrullis, Jorg
    Shallit, Jeffrey
    Smith, Tim
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2017, 2017, 10396 : 160 - 172
  • [23] Impartial games emulating one-dimensional cellular automata and undecidability
    Larsson, Urban
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2013, 120 (05) : 1116 - 1130
  • [24] Selected Ideas Used for Decidability and Undecidability of Bisimilarity
    Jancar, Petr
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2008, 5257 : 56 - 71
  • [25] DECIDABILITY AND UNDECIDABILITY THEOREMS FOR PAC-FIELDS
    CHERLIN, G
    VANDENDRIES, L
    MACINTYRE, A
    BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1981, 4 (01) : 101 - 104
  • [26] QUESTIONS OF DECIDABILITY AND UNDECIDABILITY IN NUMBER-THEORY
    MAZUR, B
    JOURNAL OF SYMBOLIC LOGIC, 1994, 59 (02) : 353 - 371
  • [27] Undecidability on quantum finite automata
    Amano, Masami
    Iwama, Kazuo
    Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 1999, : 368 - 375
  • [28] From decidability to undecidability by considering regular sets of instances
    Wolf, Petra
    THEORETICAL COMPUTER SCIENCE, 2022, 899 : 25 - 38
  • [29] On the dynamical behaviour of linear higher-order cellular automata and its decidability
    Dennunzio, Alberto
    Formenti, Enrico
    Manzoni, Luca
    Margara, Luciano
    Porreca, Antonio E.
    INFORMATION SCIENCES, 2019, 486 : 73 - 87
  • [30] Monadic fragments of godel logics:: Decidability and undecidability results
    Baaz, Matthias
    Ciabattoni, Agata
    Fermueller, Christian G.
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2007, 4790 : 77 - +
12345