Implantation of cellular automata

摘要

We consider a problem of grafting a fragment of one cellular automaton grid (implant) into the cavity cut out inside the grid of another cellular automaton (acceptor). The (non)deterministic and (a)synchronous cellular automata are examined. We offer two criteria for implantability when both implant and acceptor are passive and construct a hierarchy of implantability. Moreover, we show algorithms for active implantation (when an implant studies an acceptor actively) and compute bounds for the complexity of them.