{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T12:10:11Z","timestamp":1649160611263},"reference-count":13,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"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":[[1999,9]]},"DOI":"10.1016\/s0020-0190(99)00114-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:22:55Z","timestamp":1027624975000},"page":"175-177","source":"Crossref","is-referenced-by-count":0,"title":["Min of Mat is not necessarily Mat"],"prefix":"10.1016","volume":"71","author":[{"given":"J\u00fcrgen","family":"Dassow","sequence":"first","affiliation":[]},{"given":"Gheorghe","family":"P\u0103un","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(99)00114-3_ID006","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(93)90327-P","article-title":"Language-theoretic problems arising from Richelieu cryptosystems","volume":"116","author":"Andra\u015fiu","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(99)00114-3_ID007","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1006\/jcss.1997.1497","article-title":"The set of minimal words in a context-free language is context-free","volume":"55","author":"Berstel","year":"1997","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(99)00114-3_ID008","series-title":"Regulated Rewriting in Formal Language Theory","author":"Dassow","year":"1989"},{"key":"10.1016\/S0020-0190(99)00114-3_ID009","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1007\/BF01178731","article-title":"Petri nets algorithms in the theory of matrix grammars","volume":"31","author":"Hauschildt","year":"1994","journal-title":"Acta Inform."},{"key":"10.1016\/S0020-0190(99)00114-3_ID010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-218X(96)00023-6","article-title":"A decision method for Parikh slenderness of context-free languages","volume":"73","author":"Honkala","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(99)00114-3_ID011","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0019-9958(70)80034-1","article-title":"Simple matrix grammars","volume":"17","author":"Ibarra","year":"1970","journal-title":"Inform. and Control"},{"key":"10.1016\/S0020-0190(99)00114-3_ID012","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/0304-3975(94)00042-5","article-title":"On a conjecture about slender context-free languages","volume":"132","author":"Ilie","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(99)00114-3_ID013","unstructured":"L. Ilie, On lengths of words in context-free languages, Submitted"},{"key":"10.1016\/S0020-0190(99)00114-3_ID014","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0166-218X(94)00014-5","article-title":"Thin and slender languages","volume":"61","author":"P\u0103un","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(99)00114-3_ID015","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0304-3975(96)00308-8","article-title":"Length considerations in context-free languages","volume":"183","author":"Raz","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(99)00114-3_ID016","series-title":"Handbook of Formal Languages","year":"1997"},{"key":"10.1016\/S0020-0190(99)00114-3_ID017","series-title":"Preproceedings of Fourth Conference on Developments in Language Theory, Aachen","first-page":"164","article-title":"Slender matrix languages","author":"Stiebe","year":"1999"},{"key":"10.1016\/S0020-0190(99)00114-3_ID018","first-page":"28","article-title":"Generative grammars with regulated derivations","volume":"1","author":"Stotskij","year":"1968","journal-title":"Nauchno Techn. Inform. Ser. 2"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099001143?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099001143?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:54:51Z","timestamp":1555959291000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019099001143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":13,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["S0020019099001143"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(99)00114-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}