A NEW UNIVERSAL CELLULAR AUTOMATON ON THE PENTAGRID
Maurice Margenstern, Yu Song · Parallel Processing Letters · 2009
In this paper, we significantly improve a result of the first author, published in an issue of Theoretical Computer Science in 2003. In this paper, the authors showed the existence of a weakly universal cellular automaton on the pentagrid with 22 states. The simulation used a railway circuit which simulates a register machine. In the present paper, using the same simulation tool, we lower the number of states for a weakly universal cellular automaton down to 9.