Affiliation:
1. Vignan Institute of Technology and Management, India
Abstract
The evolution of Cellular automaton has proved to be very efficient in carrying out arbitrary information processing. A significant application lies in the theory and practice of finding a technique for unifying the information processing. But, in this case the structures used in conventional computer languages are largely inappropriate. The definite organization of computer memory into named areas, stacks, and so on, is not suitable for cellular automata in which processing elements are not distinguished from memory elements. Rather it can be assumed that the data could be represented by an object like a graph, on which transformations can be performed in parallel. This chapter initiate with basic literature on cellular automata, related definitions and notations and focuses on its applications in information processing.
Reference48 articles.
1. Abrams, M., Allison, D., Kafura, D., Ribbens, C., Rosson, M. B., Shaffer, C., & Watson, L. (1998). PSE research at Verginia Tech: An Overview. Technical Report: TR-98-21. Virginia Polytechnic Institute & State University.
2. Cellular automata models of traffic flow along a highway containing a junction
3. Braga, G., Cattaneo, G., Flocchini, P., & Vogliotti, C. Q. (1995). Pattern growth in elementary cellular automata. Theoretical Computer Science, 145(1-2), 1–26.
4. Bagging predictors