Simple Networks on Complex Cellular Automata: From de Bruijn Diagrams to Jump-Graphs

  • Martínez G
  • Adamatzky A
  • Chen B
  • et al.
N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We overview networks which characterise dynamics in cellular automata. These networks are derived from one-dimensional cellular automaton rules and global states of the automaton evolution: de Bruijn diagrams, subsystem diagrams, basins of attraction, and jump-graphs. These networks are used to understand properties of spatially-extended dynamical systems: emergence of non-trivial patterns, self-organisation, reversibility and chaos. Particular attention is paid to networks determined by travelling self-localisations, or gliders.

Cite

CITATION STYLE

APA

Martínez, G. J., Adamatzky, A., Chen, B., Chen, F., & Seck-Tuoh-Mora, J. C. (2018). Simple Networks on Complex Cellular Automata: From de Bruijn Diagrams to Jump-Graphs (pp. 241–264). https://doi.org/10.1007/978-3-662-55663-4_12

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