Abstract
This paper studies the gate generation capability of elementary cellular automaton (ECA). We first show that the basic logic gates, such as AND, OR, NOT, NAND, NOR, XOR, XNOR etc. can be realized by evolving ECAs. Since any logic circuit can be implemented by utilizing basic logic gates, the CA can implement all logic circuits. Therefore, we get a new notion of universality of CAs. We find out that there are some ECAs rules which have the universality property. Finally, we compare the gate generation capability of these CAs.KeywordsCellular automata (CAs)Elementary cellular automata (ECAs)UniversalityLogic gate
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
