Complete finite automata network graphs with minimal number of edges
Pál Dömösi, Chrystopher L. Nehaniv · 1999
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.