[1]
P. Dömösi and C. L. Nehaniv, “Complete finite automata network graphs with minimal number of edges”, Acta Cybern, vol. 14, no. 1, pp. 37-50, Jan. 1999.