ScholarLens Back to search
2009•Parallel Processing LettersRequires access

A NEW UNIVERSAL CELLULAR AUTOMATON ON THE PENTAGRID

Maurice Margenstern, Yu Song

Open publisher page 33 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 33 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Cellular automaton, Continuous automaton, Computer science, Block cellular automaton, Asynchronous cellular automaton, Automaton, Stochastic cellular automaton, Two-way deterministic finite automaton

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A NEW UNIVERSAL CELLULAR AUTOMATON ON THE PENTAGRID — Research Paper | ScholarLens