Skip to main content
SpringerLink
Log in

Computational Complexity of Cellular Automata: An Overview

  • Chapter
Cellular Automata

Part of the book series: Mathematics and Its Applications ((MAIA,volume 460))

Abstract

We give an overview of the sequential as well as the parallel complexity of cellular automata (also called cellular arrays).

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • Chandra C., Kozen D. and Stockmeyer L. Alternation. J. ACM Vol. 28 no. 1: 114–133, 1981.

    Article  MathSciNet  MATH  Google Scholar 

  • Chang C., Ibarra O. and Palis M. Efficient simulations of simple models of parallel computation by space-bounded TMs and time-bounded alternating TMs. Theoretical Computer Science Vol. no. 68: 19–36, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  • Chang C., Ibarra O. and Vergis A. On the power of one-way communication. J. ACM Vol. no. 35: 697–726, 1988.

    Article  MathSciNet  Google Scholar 

  • Choffrut C. and (ulik II K. On real-time cellular automata and trellis automata. Acta Inform. Vol. no. 21: 393–409, 1984

    Article  MathSciNet  MATH  Google Scholar 

  • Cole S. Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Trans. Comput. Vol. 18 no. 4: 346–365, 1969.

    Google Scholar 

  • Cook S. A taxonomy of problems with fast parallel algorithms. Information and Control Vol. no. 64: 2–22, 1985.

    Google Scholar 

  • Culik II K., Ibarra O. and Yu S. Iterative Tree Arrays with Logarithmic Depth. Intern. J. Computer Math. Vol. no. 20: 187–204, 1986.

    Article  MATH  Google Scholar 

  • Dyer C. One-way bounded cellular automata. Information and Control Vol. no. 44: 54–69, 1980.

    Article  MathSciNet  Google Scholar 

  • Hennie F. Iterative arrays of logical circuits MIT Press, Cambridge, Mass., 1961.

    Google Scholar 

  • Hoperoft J. and Ullman J. Introduction to automata theory, languages, and computation. Addison-Wesley, 1979.

    Google Scholar 

  • Ibarra O., Kim S. and Moran S. Sequential machine characterizations of trellis and cellular automata and applications. SIAM J. Computing Vol. no. 14: 426–447, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  • Ibarra O., Palis M. and Kim S. Some results concerning linear iterative (systolic) arrays. J. of Parallel and Distributed Computing Vol. no. 2: 182–218, 1985.

    Article  Google Scholar 

  • Ibarra O., Kim S. and Palis M. Designing Systolic Algorithms using sequential machines. IEEE Trans. on Computers Vol. 35 no. 6: 31–42, 1986.

    MathSciNet  Google Scholar 

  • Ibarra O. and Jiang T. On one-way cellular arrays. SIAM J. on Computing Vol. no. 16: 1135–1154, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  • Ibarra O. and Palis M. Two-dimensional systolic arrays: characterizations and applications. Theoretical Computer Science Vol. no. 57: 47–86, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  • Ibarra O. and Jiang T. Relating the power of cellular arrays to their closure properties. Theoretical Computer Science Vol. no. 57: 225–238, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  • Kosaraju S. On some open problems in the theory of cellular automata. IEEE Trans. on Computers Vol. no. 23: 561–565, 1974.

    Article  MathSciNet  MATH  Google Scholar 

  • Paterson N. Tape bounds for time-bounded Turing machines. Journal of Computer and System Sciences Vol. no. 6: 116–124, 1972.

    Article  MathSciNet  MATH  Google Scholar 

  • Ruzzo W. On uniform circuit complexity. Journal of Computer and System Sciences Vol. no. 22: 365–383, 1981.

    Article  MathSciNet  MATH  Google Scholar 

  • Savitch W. Relationships between nondeterministic and deterministic complexities. Journal of Computer and System Sciences Vol. no. 4: 177–192, 1970.

    Article  MathSciNet  MATH  Google Scholar 

  • Smith III A. Cellular automata and formal languages. Proc. 11th IEEE Ann. Symp. on Switching and Automata Theory 216–224, 1970.

    Google Scholar 

  • Smith III A. Cellular automata complexity trade-offs. Information and Control Vol. no. 18: 466–482, 1971.

    Article  MathSciNet  MATH  Google Scholar 

  • Smith III A. Real-time language recognition by one-dimensional cellular automata. Journal of Computer and System Sciences Vol. no. 6: 233–253, 1972.

    Article  MathSciNet  MATH  Google Scholar 

  • Umeo H., Morita K. and Sugata K. Deterministic one-way simulation of two-way real-time cellular automata and its related problems. Inform. Process. Lett. Vol. no. 14: 159–161, 1982.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    O. Ibarra

Authors
  1. O. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratoire de l’Informatique du Parallélisme, ENS Lyon, Lyon, France

    M. Delorme  & J. Mazoyer  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Ibarra, O. (1999). Computational Complexity of Cellular Automata: An Overview. In: Delorme, M., Mazoyer, J. (eds) Cellular Automata. Mathematics and Its Applications, vol 460. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9153-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-9153-9_6

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5143-1

  • Online ISBN: 978-94-015-9153-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation