Title :
Computing on a Simple Asynchronous Cellular Automaton
Author :
Jia Lee ; Peper, Ferdinand ; Imai, Koichi
Author_Institution :
Coll. of Comput. Sci. Brain, Chongqing Univ., Chongqing, China
Abstract :
An asynchronous cellular automaton (ACA) is a cellular automaton which allows cells to undergo state transitions independently at random timings. This paper gives an efficient scheme to compute on a special ACA model that takes a substantially simple transition function. This ACA has much less complexity as compared to other models with respect to the number of transition rules.
Keywords :
cellular automata; ACA model; asynchronous cellular automaton; random timings; state transition; transition function; Automata; Bars; Complexity theory; Computational modeling; Educational institutions; Integrated circuit modeling; Multiplexing;
Conference_Titel :
Computing and Networking (CANDAR), 2013 First International Symposium on
Conference_Location :
Matsuyama
Print_ISBN :
978-1-4799-2795-1
DOI :
10.1109/CANDAR.2013.90
