On tests with finite memory in finite time (Corresp.)
- 1 May 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 20 (3) , 387-388
- https://doi.org/10.1109/tit.1974.1055214
Abstract
The purpose of this correspondence is to display an inductive proof of an optimality result for testing symmetric simple hypotheses concerning a binomial parameter with a three-state memory andnobservations. Specifically, it is shown that if one restricts attention to three-state automata allowing transitions only between adjacent states, then no artificial randomization is required in the middle state of the optimal machine. The success in this problem of what will be called simultaneous induction suggests the possibility of obtaining characterizations of optimal automata in more general problems by similar techniques.Keywords
This publication has 2 references indexed in Scilit:
- Hypothesis testing with finite memory in finite time (Corresp.)IEEE Transactions on Information Theory, 1972
- Learning with Finite MemoryThe Annals of Mathematical Statistics, 1970