Testing a simple symmetric hypothesis by a finite-memory deterministic algorithm

1 September 1973

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory

Vol. 19 (5) , 644-647
https://doi.org/10.1109/tit.1973.1055082

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

SIMPLE SYMMETRIC HYPOTHESIS
FINITE-MEMORY DETERMINISTIC ALGORITHM
SMALL NUMBER
OPTIMUM ALGORITHM
TAIL
OPERATIONS RESEARCH
TESTING
RANDOM VARIABLES
ERROR PROBABILITY
ABSORPTION

This publication has 2 references indexed in Scilit:

The effects of randomization on finite-memory decision schemes
IEEE Transactions on Information Theory, 1972
Learning with Finite Memory
The Annals of Mathematical Statistics, 1970