Testing a simple symmetric hypothesis by a finite-memory deterministic algorithm
Loading...
Authors
Anderson, Calvin Marion
Subjects
Advisors
Shubert, B.O.
Date of Issue
1973-09
Date
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
A class of finite-memory deterministic algorithms is introduced and
investigated, Optimiim algorithms are found for a small number of states
(up to 21) and an asymptotic bound on error probability is obtained for
a large number of states. The algorithms provide their own stopping
rule.
Type
Thesis
Description
Series/Report No
Department
Operations Research
Organization
Naval Postgraduate School