Cyclic automata networks on finite graphs

Martín Matamala, Eric Goles

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 important to point out 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 tool as continuity, firing paths, jump and efficiency, which are interesting by themselves because they give a strong mathematical framework to study such discrete dynamical systems.

Original languageEnglish
Title of host publicationLATIN 1995
Subtitle of host publicationTheoretical Informatics - 2nd Latin American Symposium 1995, Proceedings
EditorsRicardo Baeza-Yates, Patricio V. Poblete, Eric Goles
PublisherSpringer Verlag
Number of pages13
ISBN (Print)9783540591757
StatePublished - 1995
Externally publishedYes
Event2nd International Symposium on Latin American Theoretical Informatics, LATIN 1995 - Valparaiso, Chile
Duration: 3 Apr 19957 Apr 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference2nd International Symposium on Latin American Theoretical Informatics, LATIN 1995


Dive into the research topics of 'Cyclic automata networks on finite graphs'. Together they form a unique fingerprint.

Cite this