{"id":{"repo_id":"nps","oai_identifier":"oai:calhoun.nps.edu:10945/16844"},"canonical_url":"https://search.dev.ndltd.org/etd/nps/oai:calhoun.nps.edu:10945/16844","repository":{"repo_id":"nps","name":"Naval Postgraduate School","base_url":"https://calhoun.nps.edu/server/oai/request"},"display":{"title":"Testing a simple symmetric hypothesis by a finite-memory deterministic algorithm","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Anderson, Calvin Marion"],"institution":"Monterey, California. Naval Postgraduate School","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Operations Research","school":null,"contributors":[],"advisors":["Shubert, B.O."],"committee_chairs":[],"committee_members":[],"year":1973,"date_issued":"1973-09","date_published":"1973-09","updated_at":"2026-07-27T20:25:53Z","subjects":[],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10945/16844","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Shubert, B.O."]},{"key":"dc:contributor.department","label":"Department","values":["Operations Research"]},{"key":"dc:creator","label":"Author","values":["Anderson, Calvin Marion"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2012-11-13T23:52:58Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2012-11-13T23:52:58Z"]},{"key":"dc:date.issued","label":"Date","values":["1973-09"]},{"key":"dc:publisher","label":"Institution","values":["Monterey, California. Naval Postgraduate School"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10945/16844"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Testing a simple symmetric hypothesis by a finite-memory deterministic algorithm"]}]}],"canonical_facts":{"dc:contributor.advisor":["Shubert, B.O."],"dc:contributor.department":["Operations Research"],"dc:creator":["Anderson, Calvin Marion"],"dc:date.accessioned":["2012-11-13T23:52:58Z"],"dc:date.available":["2012-11-13T23:52:58Z"],"dc:date.issued":["1973-09"],"dc:description.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."],"dc:identifier.uri":["https://hdl.handle.net/10945/16844"],"dc:language.iso":["en_US"],"dc:publisher":["Monterey, California. Naval Postgraduate School"],"dc:title":["Testing a simple symmetric hypothesis by a finite-memory deterministic algorithm"],"dc:type":["Thesis"]},"updated_at":"2026-07-27T20:25:53Z"}