{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:40Z","timestamp":1759638940007},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"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":9360,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1987,12]]},"DOI":"10.1016\/s0166-218x(87)80004-5","type":"journal-article","created":{"date-parts":[[2005,7,12]],"date-time":"2005-07-12T20:06:18Z","timestamp":1121198778000},"page":"293-304","source":"Crossref","is-referenced-by-count":7,"title":["On the context-free production complexity of finite languages"],"prefix":"10.1016","volume":"18","author":[{"given":"Zsolt","family":"Tuza","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(87)80004-5_bib1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0166-218X(83)90064-1","article-title":"A lower-bound for the number of productions required for a certain class of languages","volume":"6","author":"Alspach","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(87)80004-5_bib2","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(83)90024-5","article-title":"Context-free complexity of finite languages","author":"Bucher","year":"1981"},{"key":"10.1016\/S0166-218X(87)80004-5_bib3","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\/S0166-218X(87)80004-5_bib4","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/S0166-218X(87)80004-5_bib5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02579163","article-title":"Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices","volume":"4","author":"Tuza","year":"1984","journal-title":"Combinatorica"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X87800045?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X87800045?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T15:54:07Z","timestamp":1548345247000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X87800045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["S0166218X87800045"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(87)80004-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}