Abstract
Cellular Automata (CA) are a computational model widely used in many scientific fields. A CA consists of identical finite automata arranged over a regular lattice (i.e. every configuration of a CA is an element of A ℤ where A is a finite set of local states). Each automaton updates its state on the basis of its own state and the one of its neighbors according to a local rule. All updates are synchronous. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Chandesris, J., Dennunzio, A., Formenti, E., & Manzoni, L. (2011). Computational aspects of asynchronous cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6795 LNCS, pp. 466–468). https://doi.org/10.1007/978-3-642-22321-1_41
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
