Let 𝒟 be a class of digraphs. Supposing that the strongly connected subgraphs of digraphs in 𝒟 have unbounded size it is shown that every automation is isomorphically simulated by a network of two-state automata with underlying digraph in 𝒟. The converse statement holds, too.
