World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.
Special Issue on Cellular Automata Theory and ApplicationsNo Access

A NEW UNIVERSAL CELLULAR AUTOMATON ON THE PENTAGRID

    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.

    References