Abstract:
The problem of discrimination of two statistical hypotheses by a finite-complexity automaton is considered. A lower bound on the automaton complexity is obtained, which depends on the required values of the first- and second-kind error probabilities.
Fulltext:
PDF file (325 kB)