Automata Networks: dynamics and complexity
Adolfo Ibáñez University, Chile
IN RESIDENCE AT
Labortoire d’Informatique Fondamentale d’Orléans (LIFO), Université d’Orléans, France
We will present a class of discrete dynamical systems evolving in a discrete space (a finite connected graph) and in discrete time. Some classical examples are Cellular Automata (synchronous update over d-dimensional lattices) and Boolean Networks (Block-sequential updates in directed finite graphs). We will tell about the history of these systems, the first motivations, and display as well some results. Also we will give some examples related with neural and regulatory networks, bootstrap percolation and segregation models.