UNIVERSAL CONSTRUCTION AND SELF-REPRODUCTION ON SELF-TIMED CELLULAR AUTOMATA
Abstract
This paper proposes a universal constructor implemented on a self-timed cellular automaton, which is a particular type of asynchronous cellular automaton. Our construction utilizes the asynchronous nature of the underlying cellular automaton in a direct way, as a result of which it is simpler than the conventional construction based on the simulation of a synchronous cellular automaton by an asynchronous cellular automaton. Our model employs 39 rotation-invariant rules and the state of each cell is encoded by 8 bits.
This is an extended version of the paper entitled "Universal Construction on Self-Timed Cellular Automata" presented at the Sixth International Conference on Cellular Automata for Research and Industry (ACRI) in Amsterdam on 25–27 October 2004.
You currently do not have access to the full text article. |
---|