Statistical recognition of automata as a function of the length of the analyzed input sequence fragment

Statistical recognition of automata is considered when the arrival frequency of a fixed fragment in the output sequence is the recognition criterion. It is shown that the probability experiment length can be minimized by choice of this fragment.