Testing a Simple Symmetric Hypothesis by a Finite-Memory Deterministic Algorithm.

Abstract

A class of finite-memory deterministic algorithms is introduced and investigated. Optimum 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. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1973
Accession Number
AD0764474

Entities

People

  • Calvin Marion Anderson

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Probability

Fields of Study

  • Mathematics

Readers

  • Astronomy and Astrophysics.
  • Computational Modeling and Simulation
  • Regression Analysis.