A Universal Cellular Automaton on the Ternary Heptagrid
Maurice Margenstern, Yu Song
Abstract
Open-access reader
Maurice Margenstern, Yu Song
Abstract
Open-access reader
In this paper, we construct the first weakly universal cellular automaton on the ternary heptagrid. It requires six states only. It provides a universal automaton with less states than in the case of the pentagrid where the best result is nine states, a result also recently established by the authors.
OpenAlex reports 28 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we construct the first weakly universal cellular automaton on the ternary heptagrid. It requires six states only. It provides a universal automaton with less states than in the case of the pentagrid where the best result is nine states, a result also recently established by the authors.
Key concepts: Block cellular automaton, Cellular automaton, Continuous automaton, Reversible cellular automaton, Büchi automaton, Automaton, Construct (python library), Two-way deterministic finite automaton