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 条
  • [1] Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata
    Margenstern, Maurice
    REACHABILITY PROBLEMS, 2010, 6227 : 120 - 132
  • [2] Task automata: Schedulability, decidability and undecidability
    Fersman, Elena
    Krcal, Pavel
    Pettersson, Paul
    Yi, Wang
    INFORMATION AND COMPUTATION, 2007, 205 (08) : 1149 - 1172
  • [3] Probabilistic Automata on Infinite Words: Decidability and Undecidability Results
    Chatterjee, Krishnendu
    Henzinger, Thomas A.
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, 2010, 6252 : 1 - 16
  • [4] Cellular Automata, Decidability and Phasespace
    Sutner, K.
    FUNDAMENTA INFORMATICAE, 2010, 104 (1-2) : 141 - 160
  • [5] On the undecidability of the limit behavior of Cellular Automata
    Di Lena, P.
    Margara, L.
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (7-9) : 1075 - 1084
  • [6] On the Undecidability of Attractor Properties for Cellular Automata
    Di Lena, Pietro
    Margara, Luciano
    FUNDAMENTA INFORMATICAE, 2012, 115 (01) : 75 - 85
  • [7] A Decidability Result for the Halting of Cellular Automata on the Pentagrid
    Margenstern, Maurice
    COMPLEX SYSTEMS, 2019, 28 (02): : 175 - 196
  • [8] Stochastic Cellular Automata: Correlations, Decidability and Simulations
    Arrighi, Pablo
    Schabanel, Nicolas
    Theyssier, Guillaume
    FUNDAMENTA INFORMATICAE, 2013, 126 (2-3) : 121 - 156
  • [9] Techniques for decidability and undecidability of bisimilarity
    Jancar, P
    Moller, F
    CONCUR '99: CONCURRENCY THEORY, 1999, 1664 : 30 - 45
  • [10] Decidability and undecidability of marked PCP
    Halava, V
    Hirvensalo, M
    de Wolf, R
    STACS'99 - 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1999, 1563 : 207 - 216
12345