Abstract
This chapter discusses cellular automata. Cellular Automata is a class of mathematical systems that, at first glance, seems to have little to do with chaos or fractal systems. These were originally developed by the mathematicians John Von Neuman and Stanislaw Ulam as a model of reproduction in biological systems. Cellular automata are also known by different names, such as tessellation automata, cellular structures, or iterative arrays. In the simplest form, a cellular automaton consists of a grid or line of cells that can be in one of two states, alive or dead. In line automata, the left and right edges of the line are joined together to produce a continuous line. Two-dimensional automata will consist of a grid occupied by cells, with the left and right edges meeting and the top and bottom edges meeting. Three-dimensional cellular automata will consist of a cubic array of cells—a bit like a Rubic cube. Cellular automata can exist in different dimensional variants.
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.
