{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:33Z","timestamp":1759638333911},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11155,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1983]]},"DOI":"10.1016\/0304-3975(83)90024-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"277-285","source":"Crossref","is-referenced-by-count":11,"title":["Context-free complexity of finite languages"],"prefix":"10.1016","volume":"28","author":[{"given":"W.","family":"Bucher","sequence":"first","affiliation":[]},{"given":"H.A.","family":"Maurer","sequence":"additional","affiliation":[]},{"suffix":"II","given":"K.","family":"Culik","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90024-5_BIB1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(81)90050-5","article-title":"A note on a problem in the theory of grammatical complexity","volume":"14","author":"Bucher","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(83)90024-5_BIB2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(81)90044-X","article-title":"Concise description of finite languages","volume":"14","author":"Bucher","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(83)90024-5_BIB3","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(83)90024-5_BIB4","article-title":"Analysis of two-level grammars","author":"Wegner","year":"1978","journal-title":"Hochschulverlag, Informatik I"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900245?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900245?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:50:24Z","timestamp":1555127424000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397583900245"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90024-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}