Dynamic behavior of cyclic automata networks

Martín Matamala, Eric Goles

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


We study the principal dynamical aspects of the cyclic automata on finite graphs. We give bounds in the transient time and periodicity depending essentially on the graph structure. It is shown that there exist non-polynomial periods eΩ(√ |V|), where |V| denotes the number of sites in the graph. To obtain these results we introduce some mathematical tools as continuity, firing paths, jumps and efficiency, which are interesting by themselves because they give a strong mathematical framework to study such discrete dynamical systems.

Original languageEnglish
Pages (from-to)161-184
Number of pages24
JournalDiscrete Applied Mathematics
Issue number2
StatePublished - 8 Aug 1997
Externally publishedYes


Dive into the research topics of 'Dynamic behavior of cyclic automata networks'. Together they form a unique fingerprint.

Cite this