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
来源：
JOURNAL OF CELLULAR AUTOMATA | 2018年 / 13卷 / 5-6期
关键词：
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 条
  • [1] Asynchronous cellular automata and asynchronous automata for pomsets
    Kuske, D
    CONCUR'98: CONCURRENCY THEORY, 1998, 1466 : 517 - 532
  • [2] ASYNCHRONOUS AUTOMATA VERSUS ASYNCHRONOUS CELLULAR-AUTOMATA
    PIGHIZZINI, G
    THEORETICAL COMPUTER SCIENCE, 1994, 132 (1-2) : 179 - 207
  • [3] On asynchronous cellular automata
    Hansson, AÅ
    Mortveit, HS
    Reidys, CM
    ADVANCES IN COMPLEX SYSTEMS, 2005, 8 (04): : 521 - 538
  • [4] Quick Convergence to a Fixed Point: A Note on Asynchronous Elementary Cellular Automata
    Fates, Nazim
    CELLULAR AUTOMATA: 11TH INTERNATIONAL CONFERENCE ON CELLULAR AUTOMATA FOR RESEARCH AND INDUSTRY, 2014, 8751 : 586 - 595
  • [5] A tutorial on elementary cellular automata with fully asynchronous updatingGeneral properties and convergence dynamics
    Nazim Fatès
    Natural Computing, 2020, 19 : 179 - 197
  • [6] ASYNCHRONOUS MAPPINGS AND ASYNCHRONOUS CELLULAR-AUTOMATA
    CORI, R
    METIVIER, Y
    ZIELONKA, W
    INFORMATION AND COMPUTATION, 1993, 106 (02) : 159 - 202
  • [7] On the expressiveness of asynchronous cellular automata
    Bollig, B
    FUNDAMENTALS OF COMPUTATIONAL THEORY, PROCEEDINGS, 2005, 3623 : 528 - 539
  • [8] Weighted asynchronous cellular automata
    Kuske, D
    STACS 2006, PROCEEDINGS, 2006, 3884 : 684 - 695
  • [9] Weighted asynchronous cellular automata
    Kuske, Dietrich
    THEORETICAL COMPUTER SCIENCE, 2007, 374 (1-3) : 127 - 148
  • [10] Asynchronous cellular automata for pomsets
    Droste, M
    Gastin, P
    Kuske, D
    THEORETICAL COMPUTER SCIENCE, 2000, 247 (1-2) : 1 - 38
12345