Convergence of Asynchronous Cellular Automata: Does Size Matter?

被引:0
|
作者
Sethi, Biswanath [1 ]
Roy, Souvik [2 ]
Das, Sukanta [2 ]
机构
[1] Indira Gandhi Inst Technol, Dept Comp Sci Engn & Applicat, Dhenkanal 759146, Odisha, India
[2] Indian Inst Engn Sci & Technol, Dept Informat Technol, Howrah 711103, W Bengal, India
关键词
Asynchronous cellular automata (ACAs); Markov chains; convergence; fixed point; absorbing state;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper studies convergence of elementary cellular automata to a fixed point under fully asynchronous update. We study four possible cases- convergence of automata for any size and for the sizes that are multiple of 2, multiple of 3 and multiple of 4 only. We identify 146 cellular automata rules that converge for any size. Further, we also identify 21 and 6 rules which converge when the sizes are multiple of 2 and 3 respectively. However, we do not find any convergent rule when the sizes are multiple of 4 only. In this work we study cellular automata in fully asynchronous update as absorbing Markov chains.
引用
收藏
页码:527 / 542
页数:16
相关论文
共 50 条
  • [11] STRUCTURE IN ASYNCHRONOUS CELLULAR AUTOMATA
    INGERSON, TE
    BUVEL, RL
    PHYSICA D, 1984, 10 (1-2): : 59 - 68
  • [12] Asynchronous cellular learning automata
    Beigy, Hamid
    Meybodi, M. R.
    AUTOMATICA, 2008, 44 (05) : 1350 - 1357
  • [13] Reversibility in Asynchronous Cellular Automata
    Sarkar, Anindita
    Mukherjee, Anindita
    Das, Sukanta
    COMPLEX SYSTEMS, 2012, 21 (01): : 71 - 84
  • [14] NOTE ON ASYNCHRONOUS CELLULAR AUTOMATA
    PRIESE, L
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1978, 17 (02) : 237 - 252
  • [15] A tutorial on elementary cellular automata with fully asynchronous updating General properties and convergence dynamics
    Fates, Nazim
    NATURAL COMPUTING, 2020, 19 (01) : 179 - 197
  • [16] Foreword: asynchronous cellular automata and applications
    Alberto Dennunzio
    Nazim Fatès
    Enrico Formenti
    Natural Computing, 2013, 12 : 537 - 538
  • [17] On the complementation of asynchronous cellular Buchi automata
    Muscholl, A
    THEORETICAL COMPUTER SCIENCE, 1996, 169 (02) : 123 - 145
  • [18] Reversible computation in asynchronous cellular automata
    Lee, J
    Peper, F
    Adachi, S
    Morita, K
    Mashiko, S
    UNCONVENTIONAL MODELS IN COMPUTATION, PROCEEDINGS, 2002, 2509 : 220 - 229
  • [19] Order Independence in Asynchronous Cellular Automata
    Macauley, Matthew
    McCammond, Jon
    Mortveit, Henning S.
    JOURNAL OF CELLULAR AUTOMATA, 2008, 3 (01) : 37 - 56
  • [20] Scalable Asynchronous Execution of Cellular Automata
    Folino, Gianluigi
    Giordano, Andrea
    Mastroianni, Carlo
    NUMERICAL COMPUTATIONS: THEORY AND ALGORITHMS (NUMTA-2016), 2016, 1776