Estimating a polyhedron method informativeness in the problem of checking the automaton by the statistical properties of the input and output sequences

The problem of verification of the Moore finite state machine by the statistical properties of the input and output sequences is considered. It is assumed that the initial state of the automaton is unknown. To verify the automaton, the polyhedra method is used. The results of computational experiments for four classes of non-autonomous binary shift registers are presented.