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 条
12345