Cellular Automata: Elementary Cellular Automata

被引：7

作者：

Bhardwaj, Rupali ^{[1
]}

Upadhyay, Anil ^{[2
]}

机构：

[1] Thapar Univ, Sch Math & Comp Applicat, Patiala, Punjab, India

[2] Bipin Chandra Tripathi Kumaon Engn Coll, Dept Math, Dwarahat, India

来源：

JOURNAL OF ORGANIZATIONAL AND END USER COMPUTING | 2017年 / 29卷 / 01期

关键词：

Cellular Automata; Characteristic Matrix; Elementary Cellular Automata; Rule Equivalence; State Transition Diagram;

D O I：

10.4018/JOEUC.2017010103

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：42 / 50

页数：9