The Community for Technology Leaders
2014 Second International Symposium on Computing and Networking (CANDAR) (2014)
Shizuoka, Japan
Dec. 10, 2014 to Dec. 12, 2014
ISBN: 978-1-4799-4152-0
pp: 480-483
ABSTRACT
An implementation of Self-Reproducing Loops (SRL) on Asynchronous Cellular Automata (ACA) is proposed in this paper. The transition rules in this ACA are called Aggregate Neighborhood Rules, in which the output domain of the rules are the same as input. In the proposed SRL, the head of the loop can move backward and forward because of asynchronous nature in ACA, thus making it possible to avoid collisions of loop heads.
INDEX TERMS
Automata, Aggregates, Shape, Head, System recovery, Clocks, Educational institutions
CITATION

T. Isokawa, K. Ono, N. Matsui and F. Peper, "Self-Reproducing Loops on Asynchronous Cellular Automata with Aggregate Neighborhood Rules," 2014 Second International Symposium on Computing and Networking (CANDAR), Shizuoka, Japan, 2014, pp. 480-483.
doi:10.1109/CANDAR.2014.92
88 ms
(Ver 3.3 (11022016))