By Topic

On tests with finite memory in finite time (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

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 and n observations. 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.

Published in:

IEEE Transactions on Information Theory  (Volume:20 ,  Issue: 3 )