Resumen
With an important class of automata networks we associate a Lyapunov function and by doing so we characterize its dynamic behaviour (transient and cycle lengths). As particular cases we study threshold and majority networks.
Idioma original | Inglés |
---|---|
Páginas (desde-hasta) | 19-32 |
Número de páginas | 14 |
Publicación | Theoretical Computer Science |
Volumen | 41 |
N.º | C |
DOI | |
Estado | Publicada - 1985 |
Publicado de forma externa | Sí |