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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bidlo, M., VaÅ¡Ãcek, Z.: Gate-level evolutionary development using cellular automata. In: NASA/ESA Conference on Adaptive Hardware and Systems, AHS’08. pp. 11–18. IEEE (2008)
Chopard, B., Droz, M.: Cellular Automata Modelling of Physical Systems. Cambridge University Press, Cambridge (1998)
Cook, M.: Universality in elementary cellular automata. Complex Syst. 15(1), 1–40 (2004)
Hazari, R., Kundu, S., Bhardwaj, M., Das, S.: ECA 184 can implement any logic circuits. J. Cell. Autom. 13(4), 359–371 (2018)
Li, W., Packard, N.: The structure of the elementary cellular automata rule space. Complex Syst. 4(3), 281–297 (1990)
MartÃnez, G.J., Adamatzky, A., Morita, K.: Logical gates via gliders collisions. In: Reversibility and Universality, pp. 199–220. Springer, Berlin (2018)
MartÃnez, G.J., Adamatzky, A., McIntosh, H.V.: Phenomenology of glider collisions in cellular automaton rule 54 and associated logical gates. Chaos, Solitons Fractals 28(1), 100–111 (2006)
Mitchell, M.: Computation in cellular automata: A selected review. In: Non-Standard Computation. Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim (1996)
Neary, T., Woods, D.: P-completeness of cellular automaton rule 110. In: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming - Volume Part I, ICALP 2006, pp. 132–143. Springer, berlin (2006)
Pries, W., Thanailakis, A., Card, H.C.: Group properties of cellular automata and VLSI applications. IEEE Trans. Comput. C-35(12), 1013–1024 (1986)
Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55(3), 601–644 (1983)
Wolfram, S.: Universality and complexity in cellular automata. Phys. D 10(1–2), 1–35 (1984)
Wolfram, S.: Cellular Automata and Complexity: Collected Papers. Westview Press (1994)
Wolfram, S.: A New Kind of Science. Wolfram-Media Inc., Champaign (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Hazari, R. (2022). A New Notion of Universality in Respect of Logic Gates Generation Capability of ECAs. In: Das, S., Martinez, G.J. (eds) Proceedings of First Asian Symposium on Cellular Automata Technology. ASCAT 2022. Advances in Intelligent Systems and Computing, vol 1425. Springer, Singapore. https://doi.org/10.1007/978-981-19-0542-1_13
Download citation
DOI: https://doi.org/10.1007/978-981-19-0542-1_13
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-0541-4
Online ISBN: 978-981-19-0542-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)