Algebraic criteria for finite automata understanding of regular language