Abstract
In this work we associate discrete Lyapunov operators to a class of automata networks called extremal automata. These operators allow us to characterize the steady state and to give bounds for the transient time.
| Original language | English |
|---|---|
| Pages (from-to) | 329-337 |
| Number of pages | 9 |
| Journal | Theoretical Computer Science |
| Volume | 125 |
| Issue number | 2 |
| DOIs | |
| State | Published - 28 Mar 1994 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'Lyapunov operators to study the convergence of extremal automata'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver