Abstract
This chapter explores cellular automata. It starts off by presenting a minimal description used to define cellular automata. The chapter also discusses a mathematical formulation of cellular automata. In the context of microstructure evolution, cellular automata are mathematical algorithms that describe the discrete spatial and temporal evolution of complex systems. The irregular and shapeless cellular automata are described in detail in the chapter. The concept behind irregular cellular automata is that the cells are distributed randomly. Shapeless cell shapes are not computed explicitly; only a point position is used. Shapeless cells have the advantage of being much more flexible in their definition of neighborhood. The hybrid cellular automata modeling are also explained here, which means combinations of different types of CA and other computational methods. The chapter discusses the lattice gas cellular automata. Lattice gas cellular automata are a form of CA in which position and momentum of interacting particles are modeled on a discrete grid of points. Finally, the last section of the chapter discusses the network cellular automata (NCA), which are a fairly recent development of cellular automata. The chapter presents a brief definition of the same.
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.
