Skip to main content
Conference Proceedings

Tutorial on cellular automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6714 LNCS 34-35
DOI: 10.1007/978-3-642-21341-0_7
0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This tutorial surveys computational aspects of cellular automata, a discrete dynamical model introduced by S. Ulam and J. von Neumann in the late 40s: a regular grid of finite state cells evolving synchronously according to a common local rule described by a finite automaton. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ollinger, N. (2011). Tutorial on cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6714 LNCS, pp. 34–35). https://doi.org/10.1007/978-3-642-21341-0_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free