{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T15:09:03Z","timestamp":1775833743125,"version":"3.50.1"},"reference-count":37,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1976,1,1]],"date-time":"1976-01-01T00:00:00Z","timestamp":189302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":13713,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1976,1]]},"DOI":"10.1016\/s0019-9958(76)90456-3","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"49-85","source":"Crossref","is-referenced-by-count":12,"title":["Optimal finite memory learning algorithms for the finite sample problem"],"prefix":"10.1016","volume":"30","author":[{"given":"Thomas M.","family":"Cover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Freedman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin E.","family":"Hellman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(76)90456-3_bib1","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/TSMC.1972.5408555","article-title":"Adaptive signal detection with finite memory","volume":"SMC-2","author":"Baxa","year":"1972","journal-title":"IEEE Trans. Syst. Man. Cybern."},{"key":"10.1016\/S0019-9958(76)90456-3_bib2","article-title":"On expediency and convergence in variable-structure automata","volume":"SSC-4","author":"Chandrasekaran","year":"1968","journal-title":"IEEE Trans. Sys. Sci. and Cybern."},{"key":"10.1016\/S0019-9958(76)90456-3_bib3","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/TIT.1975.1055331","article-title":"A finite-memory deterministic algorithm for the symmetric hypothesis testing problem","volume":"IT-21","author":"Chandrasekaran","year":"1975","journal-title":"IEEE Trans. on Info. Theory"},{"key":"10.1016\/S0019-9958(76)90456-3_bib4","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1214\/aoms\/1177697590","article-title":"Hypothesis testing with finite statistics","volume":"40","author":"Cover","year":"1969","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/S0019-9958(76)90456-3_bib5","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1109\/TIT.1970.1054427","article-title":"The two-armed bandit problem with time invariant finite memory","volume":"IT-16","author":"Cover","year":"1970","journal-title":"IEEE Trans. on Info. Theory"},{"key":"10.1016\/S0019-9958(76)90456-3_bib6","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1109\/TIT.1972.1054820","article-title":"Hypothesis testing with finite memory in finite time","volume":"IT-18","author":"Flower","year":"1972","journal-title":"IEEE Trans. on Info. Theory"},{"key":"10.1016\/S0019-9958(76)90456-3_bib7","article-title":"A Finite Memory, Finite Time, Gaussian Hypothesis Testing Problem","author":"Freedman","year":"1971"},{"key":"10.1016\/S0019-9958(76)90456-3_bib8","article-title":"On the Behavior of Learning Automata and its Applications","author":"Fu","year":"1968","journal-title":"Purdue University Technical Report No. TR-EE 68-20"},{"key":"10.1016\/S0019-9958(76)90456-3_bib9","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1214\/aoms\/1177693334","article-title":"On memory saved by randomization","volume":"42","author":"Hellman","year":"1971","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/S0019-9958(76)90456-3_bib10","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1214\/aoms\/1177696958","article-title":"Learning with finite memory","volume":"41","author":"Hellman","year":"1970","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/S0019-9958(76)90456-3_bib11","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1109\/TIT.1972.1054846","article-title":"The effects of randomization on finite memory decision schemes","volume":"IT-18","author":"Hellman","year":"1972","journal-title":"IEEE Trans. on Info. Theory"},{"key":"10.1016\/S0019-9958(76)90456-3_bib12","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1109\/TIT.1974.1055229","article-title":"Finite memory algorithms for estimating the mean of a Gaussian distribution","volume":"IT-20","author":"Hellman","year":"1974","journal-title":"IEEE Trans. on Info. Theory"},{"key":"10.1016\/S0019-9958(76)90456-3_bib13","doi-asserted-by":"crossref","DOI":"10.1214\/aos\/1176343194","article-title":"A finite memory test of the irrationality of the parameter of a coin","author":"Hirschler","year":"1975","journal-title":"Ann. Statistics"},{"key":"10.1016\/S0019-9958(76)90456-3_bib14","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1109\/TIT.1972.1054918","article-title":"A confidence model for finite-memory learning systems","volume":"IT-18","author":"Horos","year":"1972","journal-title":"IEEE Trans. on Info. Theory"},{"key":"10.1016\/S0019-9958(76)90456-3_bib15","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1214\/aoms\/1177706278","article-title":"On a problem of robbins","volume":"30","author":"Isbell","year":"1959","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/S0019-9958(76)90456-3_bib16","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1109\/TIT.1973.1055080","article-title":"Sequential estimation with a finite statistic","volume":"IT-19","author":"Koplowitz","year":"1973","journal-title":"IEEE Trans. on Info. Theory"},{"key":"10.1016\/S0019-9958(76)90456-3_bib17","article-title":"A note on hypothesis testing with a finite statistic","author":"Koplowitz","year":"1974","journal-title":"IEEE Trans. on Info. Theory"},{"issue":"9","key":"10.1016\/S0019-9958(76)90456-3_bib18","first-page":"1226","article-title":"On one automaton that is asymptotically optimal in a random medium","volume":"24","author":"Krylov","year":"1963","journal-title":"Avtomatika i Telemekhanika"},{"key":"10.1016\/S0019-9958(76)90456-3_bib19","article-title":"Finite Memory Detectors","author":"Lynn","year":"1971"},{"key":"10.1016\/S0019-9958(76)90456-3_bib20","series-title":"presented at 1972 IEEE International Symposium on Information Theory","article-title":"Bounds on Finite Memory Detectors","author":"Lynn","year":"1972"},{"key":"10.1016\/S0019-9958(76)90456-3_bib21","article-title":"Optimum, Time-Varying, Finite-Memory Detection","author":"Muise","year":"1971"},{"key":"10.1016\/S0019-9958(76)90456-3_bib22","series-title":"Abstracts of Papers, 1972 IEEE International Symposium on Information Theory","first-page":"35","article-title":"Detection with time-varying finite-memory receivers","author":"Muise","year":"1972"},{"key":"10.1016\/S0019-9958(76)90456-3_bib23","article-title":"A Class of Finite Memory Decision Processes","author":"Mullis","year":"1968"},{"key":"10.1016\/S0019-9958(76)90456-3_bib24","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TSSC.1968.300124","article-title":"Memory limitation and multistage decision processes","volume":"SSC-4","author":"Mullis","year":"1968","journal-title":"IEEE Trans. on Sys. Sci. and Cybern."},{"key":"10.1016\/S0019-9958(76)90456-3_bib25","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1109\/TIT.1974.1055258","article-title":"Finite memory problems and algorithms","volume":"IT-20","author":"Mullis","year":"1974","journal-title":"IEEE Trans. on Info. Theory"},{"key":"10.1016\/S0019-9958(76)90456-3_bib26","first-page":"197","article-title":"Stochastic Processes","author":"Parzen","year":"1962"},{"key":"10.1016\/S0019-9958(76)90456-3_bib27","first-page":"920","article-title":"A sequential decision problem with a finite memory","volume":"42","author":"Robbins","year":"1956"},{"key":"10.1016\/S0019-9958(76)90456-3_bib28","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1109\/TIT.1970.1054536","article-title":"Estimation with finite memory","volume":"IT-16","author":"Roberts","year":"1970","journal-title":"IEEE Trans. on Info. Theory"},{"key":"10.1016\/S0019-9958(76)90456-3_bib29","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1109\/TIT.1973.1055081","article-title":"Estimating a binomial parameter with finite memory","volume":"IT-19","author":"Samaniego","year":"1973","journal-title":"IEEE Trans. on Info. Theory"},{"key":"10.1016\/S0019-9958(76)90456-3_bib30","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1109\/TIT.1974.1055214","article-title":"On tests with finite memory in finite time","volume":"IT-20","author":"Samaniego","year":"1974","journal-title":"IEEE Trans. on Info. Theory"},{"key":"10.1016\/S0019-9958(76)90456-3_bib31","doi-asserted-by":"crossref","first-page":"2103","DOI":"10.1214\/aoms\/1177698038","article-title":"Randomized rules for the two-armed bandit with finite memory","volume":"39","author":"Samuels","year":"1968","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/S0019-9958(76)90456-3_bib32","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1973.1055082","article-title":"Testing a simple symmetric hypothesis by a finite-memory deterministic algorithm","volume":"IT-19","author":"Shubert","year":"1973","journal-title":"IEEE Trans. on Info. Theory"},{"key":"10.1016\/S0019-9958(76)90456-3_bib33","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIT.1974.1055213","article-title":"Finite-memory classification of Bernoulli sequences using reference samples","volume":"IT-20","author":"Shubert","year":"1974","journal-title":"IEEE Trans. on Info. Theory"},{"key":"10.1016\/S0019-9958(76)90456-3_bib34","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1109\/TSMC.1973.4309226","article-title":"On estimating random processes with finite memory","volume":"SMC-3","author":"Tooley","year":"1973","journal-title":"IEEE Trans. Syst., Man, Cybern."},{"issue":"10","key":"10.1016\/S0019-9958(76)90456-3_bib35","first-page":"1345","article-title":"On the behavior of finite automata in random media","volume":"22","author":"Tsetlin","year":"1961","journal-title":"Avtomatika i Telemekhanika"},{"key":"10.1016\/S0019-9958(76)90456-3_bib36","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1109\/TIT.1972.1054853","article-title":"Estimation of the mean with time-varying finite memory","volume":"IT-18","author":"Wagner","year":"1972","journal-title":"IEEE Trans. on Info. Theory"},{"key":"10.1016\/S0019-9958(76)90456-3_bib37","series-title":"Principles of Communication Engineering","author":"Wozencraft","year":"1965"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995876904563?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995876904563?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T14:22:43Z","timestamp":1548944563000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995876904563"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,1]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,1]]}},"alternative-id":["S0019995876904563"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(76)90456-3","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1976,1]]}}}