Skip to main content
SpringerLink
Log in

Generalized Cellular Automata

  • Chapter
Real-Time Parallel Computing

  • 70 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • 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 

  • Wu, A., and Rosenfeld, A., “Cellular Graph Automata (I and II),” Info. Control 42:305–353 (1979).

    Article  Google Scholar 

  • Wu, A., and Rosenfeld, A., “Sequential and Cellular Graph Automata,” Info. Sciences 20:57–68 (1980).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD, 20742, USA

    A. Rosenfeld

Authors
  1. A. Rosenfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Tokyo, Tokyo, Japan

    Morio Onoe

  2. Carnegie-Mellon Universiy, Pittsburgh, Pennsylvania, USA

    Kendall Preston Jr.

  3. University of Maryland, College Park, Maryland, USA

    Azriel Rosenfeld

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Plenum Press, New York

About this chapter

Cite this chapter

Rosenfeld, A. (1981). Generalized Cellular Automata. In: Onoe, M., Preston, K., Rosenfeld, A. (eds) Real-Time Parallel Computing. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-3893-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-3893-2_4

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4684-3895-6

  • Online ISBN: 978-1-4684-3893-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation