On connectivity of a graph representing an automaton of many states

A connectivity criterion is proposed for a transition graph of a finite automation. The criterion features relatively low labor consumption and applicable to analysis of finite automata with many states when conventional connectivity criteria are inapplicable.