Back to search
Monterey, California. Naval Postgraduate School
Testing a simple symmetric hypothesis by a finite-memory deterministic algorithm
Abstract
dc:description.abstractA 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.
Degree
thesis:*- Department dc:contributor.department
- Operations Research
- Grantor dc:publisher
- Monterey, California. Naval Postgraduate School
- Year dc:date.issued
- 1973
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Anderson, Calvin Marion
- Advisor dc:contributor.advisor
-
- Shubert, B.O.
Rights
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- https://hdl.handle.net/10945/16844
- OAI identifier oai:identifier
- oai:calhoun.nps.edu:10945/16844