Welcome to the InfoSci Platform
Reference Hub2
Cellular Automata: Elementary Cellular Automata

Cellular Automata: Elementary Cellular Automata

Rupali Bhardwaj, Anil Upadhyay
Copyright: © 2017 |Volume: 29 |Issue: 1 |Pages: 9
ISSN: 1546-2234|EISSN: 1546-5012|EISBN13: 9781522510840|DOI: 10.4018/JOEUC.2017010103
Cite Article Cite Article

MLA

Bhardwaj, Rupali, and Anil Upadhyay. "Cellular Automata: Elementary Cellular Automata." JOEUC vol.29, no.1 2017: pp.42-50. http://doi.org/10.4018/JOEUC.2017010103

APA

Bhardwaj, R. & Upadhyay, A. (2017). Cellular Automata: Elementary Cellular Automata. Journal of Organizational and End User Computing (JOEUC), 29(1), 42-50. http://doi.org/10.4018/JOEUC.2017010103

Chicago

Bhardwaj, Rupali, and Anil Upadhyay. "Cellular Automata: Elementary Cellular Automata," Journal of Organizational and End User Computing (JOEUC) 29, no.1: 42-50. http://doi.org/10.4018/JOEUC.2017010103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical study of elementary cellular automata which includes concepts of rule equivalence, evolution of cellular automata and classification of cellular automata. In addition, explanation of behaviour of cellular automata is revealed through example.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.