Abstract
In this work standard lattice cellular automata and random Boolean networks are extended to a wider class of generalized automata networks having any graph topology as a support. Dynamical, computational, and problem solving capabilities of these automata networks are then discussed through selected examples, and put into perspective with respect to current and future research. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Tomassini, M. (2006). Generalized automata networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4173 LNCS, pp. 14–28). Springer Verlag. https://doi.org/10.1007/11861201_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
