{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T03:55:41Z","timestamp":1772250941455,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1016\/0020-0190(94)00056-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"289-292","source":"Crossref","is-referenced-by-count":18,"title":["An optimal lower bound for nonregular languages"],"prefix":"10.1016","volume":"50","author":[{"given":"Alberto","family":"Bertoni","sequence":"first","affiliation":[]},{"given":"Carlo","family":"Mereghetti","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Pighizzini","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00056-5_BIB1","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/990502.990506","article-title":"A language over a one symbol alphabet requiring only O(log log n) space","volume":"7","author":"Alt","year":"1975","journal-title":"SIGACT News"},{"key":"10.1016\/0020-0190(94)00056-5_BIB2","series-title":"An Introduction to the Theory of Numbers","author":"Hardy","year":"1979"},{"key":"10.1016\/0020-0190(94)00056-5_BIB3","first-page":"179","article-title":"Hierarchies of memory limited computations","author":"Hartmanis","year":"1965","journal-title":"IEEE Conf. Record on Switching Circuit Theory and Logical Design"},{"key":"10.1016\/0020-0190(94)00056-5_BIB4","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","article-title":"One-tape, off-line Turing machine computations","volume":"8","author":"Hennie","year":"1965","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(94)00056-5_BIB5","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321495.321508","article-title":"Some results on tape-bounded Turing machines","volume":"16","author":"Hopcroft","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(94)00056-5_BIB6","series-title":"Introduction to Automata Theory, Languages, and Computations","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0020-0190(94)00056-5_BIB7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1109\/FOCS.1965.14","article-title":"Memory bounds for the recognition of context free and context sensitive languages","author":"Lewis","year":"1965","journal-title":"IEEE Conf. Record on Switching Circuit Theory and Logical Design"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000565?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000565?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:50:59Z","timestamp":1555145459000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094000565"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["0020019094000565"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00056-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}