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 条
  • [41] Complexities of One-way Jumping Finite Automata
    Fazekas, Szilard Zsolt
    Mercas, Robert
    Prigioniero, Luca
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2024, (407):
  • [42] ONE-WAY MULTIHEAD WRITING FINITE AUTOMATA
    SUDBOROUGH, IH
    INFORMATION AND CONTROL, 1976, 30 (01): : 1 - 20
  • [43] ONE-WAY MULTIHEAD DETERMINISTIC FINITE AUTOMATA
    HROMKOVIC, J
    ACTA INFORMATICA, 1983, 19 (04) : 377 - 384
  • [44] On the Weakness of One-Way Quantum Pushdown Automata
    Nakanishi, Masaki
    FOURTH INTERNATIONAL CONFERENCE ON QUANTUM, NANO AND MICRO TECHNOLOGIES: ICQNM 2010, PROCEEDINGS, 2010, : 83 - 87
  • [45] Real-time recognition of cyclic strings by one-way and two-way cellular automata
    Nakamura, K
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2005, E88D (01) : 65 - 71
  • [46] One guess one-way cellular arrays
    Buchholz, T
    Klein, A
    Kutrib, M
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998, 1998, 1450 : 807 - 815
  • [47] Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata
    Geffert, Viliam
    Okhotin, Alexander
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014, PT I, 2014, 8634 : 291 - +
  • [48] Determining the equivalence for one-way quantum finite automata
    Li, Lvzhou
    Qiu, Daowen
    THEORETICAL COMPUTER SCIENCE, 2008, 403 (01) : 42 - 51
  • [49] One-way reversible and quantum finite automata with advice
    Yamakami, Tomoyuki
    INFORMATION AND COMPUTATION, 2014, 239 : 122 - 148
  • [50] Properties of right one-way jumping finite automata
    Beier, Simon
    Holzer, Markus
    THEORETICAL COMPUTER SCIENCE, 2019, 798 : 78 - 94
12345