Searching the space of cellular automata basing on the analysis of the connections graphs

The paper describes the idea of searching the space of 2D cellular automata rules using the graphs of connections. Nodes are the "one" cells in the configurations for which the rule takes the value "1". Branches of a graph connect all "ones" in given configuration. The same graph when only rotated or mirror reflected is connected with group of rules, which generate the same behaviour of the cellular automaton. Thanks to that the computer investigation of automata space, in order to extract automata with interesting behaviour, can be reduced to test representatives of distinguish groups.