2018/03/14 by Genaro J. Martinez, Andrew Adamatzky, Kenichi Morita · 1 voice
Computer Science · Physics and Astronomy · #cs.ET #nlin.CG
published as Journal of Cellular Automata, 13(4), 325--346, 2018 · 31 pages, 23 figures, 3 tables
arxiv created 2018/03/14 · arxiv published 2018/03/14 · arxiv updated 2018/03/16
An elementary cellular automaton with memory is a chain of finite state machines (cells) updating their state simultaneously and by the same rule. Each cell updates its current state depending on current states of its immediate neighbours and a certain number of its own past states. Some cell-state transition rules support gliders, compact patterns of non-quiescent states translating along the chain. We present designs of logical gates, including reversible Fredkin gate and controlled NOT gate, implemented via collisions between gliders.