{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:43Z","timestamp":1740131683021,"version":"3.37.3"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/tit.2017.2734655","type":"journal-article","created":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T18:34:21Z","timestamp":1501612461000},"page":"6538-6546","source":"Crossref","is-referenced-by-count":2,"title":["Regular Hilberg Processes: An Example of Processes With a Vanishing Entropy Rate"],"prefix":"10.1109","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7136-5283","authenticated-orcid":false,"given":"Lukasz","family":"Debowski","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18781-5_4"},{"key":"ref11","first-page":"33","article-title":"Hilberg’s conjecture—A challenge for machine learning","volume":"23","author":"d?bowski","year":"2014","journal-title":"Schedae Inf"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1515\/FREQ.1990.44.9-10.243"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3390\/e17085903"},{"key":"ref14","first-page":"23","article-title":"Maximal lengths of repeat in English prose","author":"d?bowski","year":"2012","journal-title":"Synergetic Linguistics Text and Language as Dynamic Systems"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1951.tb01366.x"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055912"},{"key":"ref17","first-page":"31","article-title":"An estimate of an upper bound for the entropy of English","volume":"18","author":"brown","year":"1983","journal-title":"Comput Linguistics"},{"journal-title":"Data compression and entropy estimates by non-sequential recursive pair substitution","year":"2002","author":"grassberger","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2003.1194035"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10959-009-0264-0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1024404290"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.06.023"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.212281"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48321-7_31"},{"key":"ref8","first-page":"1","article-title":"On correlation polynomials and subword complexity","author":"gheorghiciuc","year":"2007","journal-title":"Discrete Math and Theoretical Computer Science"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00400-2"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176989686"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00248-5"},{"key":"ref9","first-page":"185","article-title":"Exact approximation of average subword complexity of finite random words over finite alphabet","volume":"14","author":"ivanko","year":"2008","journal-title":"Trudy Instituta Matematiki i Mekhaniki UrO RAN"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3390\/e18100364"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055287"},{"journal-title":"Foundations of Modern Probability","year":"1997","author":"kallenberg","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/18.104321"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2009.01.016"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1090-5"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176994624"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8036324\/07999253.pdf?arnumber=7999253","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T03:00:04Z","timestamp":1633921204000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7999253\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":29,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2734655","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2017,10]]}}}