Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 19-32 |
| Number of pages | 14 |
| Journal | Theoretical Computer Science |
| Volume | 41 |
| Issue number | C |
| DOIs | |
| State | Published - 1985 |
| Externally published | Yes |