A Decidability Result for the Halting of Cellular Automata on the Pentagrid

摘要

In this paper, we investigate the halting problem for deterministic cellular automata on the pentagrid. We prove that the problem is decidable when the cellular automaton starts its computation from a finite configuration and when it has two states, one of them being a quiescent state.