Sequence generation problem on communication-restricted cellular automata
Naoki Kamikawa, Hiroshi Umeo · 2006
Cellular automata (CA) are considered to be a non-linear model of complex systems in which an infinite one-dimensional array of finite state machines (cells) updates itself in a synchronous manner according to a uniform local rule. We study a sequence generation problem on a special restricted class of cellular automata having 1-bit inter-cell communications (CA1-bit) and propose several state-efficient real-time sequence generation algorithms for non-regular sequences.