Title :
Testing a simple symmetric hypothesis by a finite-memory deterministic algorithm
Author :
Shubert, Bruno O. ; Anderson, Calvin M.
fDate :
9/1/1973 12:00:00 AM
Abstract :
A class of finite-memory deterministic algorithms is introduced and investigated. Optimum algorithms are found for small numbers (up to 21) of states. The algorithms provide their own stopping rules.
Keywords :
Decision procedures; Finite-memory methods; Absorption; Counting circuits; Error probability; Operations research; Random variables; Tail; Testing;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1973.1055082
