Abstract
An automata network graph is said to be n-complete (under projection) if every automata network having underlying graph with n vertices can be simulated (under projection) on it. In this paper n-complete automata network graphs with minimal number of edges are completely characterized.
| Original language | English |
|---|---|
| Pages (from-to) | 37-50 |
| Number of pages | 14 |
| Journal | Acta Cybernetica |
| Volume | 14 |
| Issue number | 1 |
| Publication status | Published - 1 Jan 1999 |
| Externally published | Yes |