Estimating a probability using finite memory

This publication has 25 references indexed in Scilit:

• On testing simple hypotheses in finite time with Hellman-Cover automata
  IEEE Transactions on Information Theory, 1975
• A Flow-Graph Formula for the Stationary Distribution of a Markov Chain
  IEEE Transactions on Systems, Man, and Cybernetics, 1975
• Finite-memory algorithms for estimating the mean of a Gaussian distribution (Corresp.)
  IEEE Transactions on Information Theory, 1974
• On tests with finite memory in finite time (Corresp.)
  IEEE Transactions on Information Theory, 1974
• Finite-memory classification of Bernoulli sequences using reference samples (Corresp.)
  IEEE Transactions on Information Theory, 1974
• Testing a simple symmetric hypothesis by a finite-memory deterministic algorithm
  IEEE Transactions on Information Theory, 1973
• Estimating a binomial parameter with finite memory
  IEEE Transactions on Information Theory, 1973
• Estimation of the mean with time-varying finite memory (Corresp.)
  IEEE Transactions on Information Theory, 1972
• Hypothesis testing with finite memory in finite time (Corresp.)
  IEEE Transactions on Information Theory, 1972
• Learning with Finite Memory
  The Annals of Mathematical Statistics, 1970