Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
