A decidability result for the halting problem of cellular automata in the pentagrid
Abstract
In this paper, we investigate the halting problem for deterministic cellula automata in the pentagrid. We prove that the problem is decidable when the cellular automaton starts its computation from a finite configuration and when it has at most two states, one of them being a quiescent state.
- Publication:
-
arXiv e-prints
- Pub Date:
- December 2018
- DOI:
- 10.48550/arXiv.1812.03882
- arXiv:
- arXiv:1812.03882
- Bibcode:
- 2018arXiv181203882M
- Keywords:
-
- Computer Science - Formal Languages and Automata Theory;
- Nonlinear Sciences - Cellular Automata and Lattice Gases;
- 68R05;
- F.2.2
- E-Print:
- 18 pages, 10 figures