A Weakly Universal Cellular Automaton on the Heptagrid with Three States
Maurice Margenstern
Abstract
Maurice Margenstern
Abstract
In this paper, we improve previous results giving the construction of a weakly universal cellular automaton on the heptagrid. Here we obtain such a cellular automaton with three states only. Our cellular automaton makes use of the railway circuit model to which we give here several important changes.
OpenAlex reports 5 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 improve previous results giving the construction of a weakly universal cellular automaton on the heptagrid. Here we obtain such a cellular automaton with three states only. Our cellular automaton makes use of the railway circuit model to which we give here several important changes.
Key concepts: Cellular automaton, Continuous automaton, Block cellular automaton, Asynchronous cellular automaton, Reversible cellular automaton, Computer science, Stochastic cellular automaton, Automaton