Cellular automata are arrays of processing elements which operate in a synchronous, parallel fashion and can be used to process or classify their arrays of input data. This chapter summarizes work done over the past few years at the University of Maryland on generalizations of the basic cellular automaton concept. It shows how the speed and power of cellular automata can be increased by extending the array into an appropriately connected larger structure or by allowing the individual processors to have larger amounts of internal memory. It also extends the cellular automaton concept to networks of processors in which each node has bounded degree and discusses the graph processing and recognition capabilities of such networks.
KeywordsCellular Automaton Input String Recognition Capability Quad Tree Distinguishable Neighbor
Unable to display preview. Download preview PDF.
- Dyer, C. R., “Augmented Cellular Automata for Image Analysis,” Ph.D. Dissertation, University of Maryland, College Park (1979).Google Scholar
- Dyer, C. R., and Rosenfeld, A., “Parallel Image Processing by Memory Augmented Cellular Automata,” IEEETPAMI (1980) (in press).Google Scholar
- Rosenfeld, A., Picture Languages, New York, Academic Press (1979).Google Scholar
- Wu, A. Y., “Cellular Graph Automata,” Ph.D. Dissertation, University of Maryland, College Park (1978).Google Scholar