Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups

被引：4
|
作者：
Delacourt, Martin [1 ]
Ollinger, Nicolas [1 ]
机构：
[1] Univ Orleans, LIFO EA 4022, F-45067 Orleans, France
来源：
UNVEILING DYNAMICS AND COMPLEXITY, CIE 2017 | 2017年 / 10307卷
关键词：
Reset Mealy automata; One-sided cellular automata; Permutive cellular automata; Periodicity problem; Reversible computation;
D O I：
10.1007/978-3-319-58741-7_23
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The decidability of the finiteness problem for automaton groups is a well-studied open question on Mealy automata. We connect this question of algebraic nature to the periodicity problem of one-way cellular automata, a dynamical question known to be undecidable in the general case. We provide a first undecidability result on the dynamics of one-way permutive cellular automata, arguing in favor of the undecidability of the finiteness problem for reset Mealy automata.
引用
收藏
页码：234 / 245
页数：12
相关论文
共 50 条
  • [1] Shrinking One-Way Cellular Automata
    Kutrib, Martin
    Malcher, Andreas
    Wendlandt, Matthias
    CELLULAR AUTOMATA AND DISCRETE COMPLEX SYSTEMS, AUTOMATA 2015, 2015, 9099 : 141 - 154
  • [2] Fast one-way cellular automata
    Klein, A
    Kutrib, M
    THEORETICAL COMPUTER SCIENCE, 2003, 295 (1-3) : 233 - 250
  • [3] Shrinking one-way cellular automata
    Martin Kutrib
    Andreas Malcher
    Matthias Wendlandt
    Natural Computing, 2017, 16 : 383 - 396
  • [4] Shrinking one-way cellular automata
    Kutrib, Martin
    Malcher, Andreas
    Wendlandt, Matthias
    NATURAL COMPUTING, 2017, 16 (03) : 383 - 396
  • [5] Complexity of One-Way Cellular Automata
    Kutrib, Martin
    CELLULAR AUTOMATA AND DISCRETE COMPLEX SYSTEMS (AUTOMATA 2014), 2015, 8996 : 3 - 18
  • [6] ONE-WAY BOUNDED CELLULAR AUTOMATA
    DYER, CR
    INFORMATION AND CONTROL, 1980, 44 (03): : 261 - 281
  • [7] On one-way cellular automata with a fixed number of cells
    Malcher, A
    FUNDAMENTA INFORMATICAE, 2003, 58 (3-4) : 355 - 368
  • [8] On time computability of functions in one-way cellular automata
    Buchholz, T
    Kutrib, M
    ACTA INFORMATICA, 1998, 35 (04) : 329 - 352
  • [9] On time computability of functions in one-way cellular automata
    Thomas Buchholz
    Martin Kutrib
    Acta Informatica, 1998, 35 : 329 - 252
  • [10] ON THE FINITENESS PROBLEM FOR AUTOMATON (SEMI) GROUPS
    Akhavi, Ali
    Klimann, Ines
    Lombardy, Sylvain
    Mairesse, Jean
    Picantin, Matthieu
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2012, 22 (06)
12345