{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:01Z","timestamp":1759638301563},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540083535"},{"type":"electronic","value":"9783540372851"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1977]]},"DOI":"10.1007\/3-540-08353-7_144","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:24:06Z","timestamp":1330187046000},"page":"263-271","source":"Crossref","is-referenced-by-count":1,"title":["Complexity and minimality of context-free grammars and languages"],"prefix":"10.1007","author":[{"given":"A.","family":"\u010cern\u00fd","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"22_CR1","volume-title":"The Mathematical Theory of Context-Free Languages","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York 1966"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/S0019-9958(69)90055-2","volume":"14","author":"J. Gruska","year":"1969","unstructured":"Gruska, J., Some Classifications of Context-Free Languages, Information and Control, 14 (1969) 152\u2013179","journal-title":"Information and Control"},{"key":"22_CR3","first-page":"22","volume":"3","author":"J. Gruska","year":"1967","unstructured":"Gruska, J., On a Classification of Context-Free Languages, Kybernetika 3 (1967) 22\u201329","journal-title":"Kybernetika"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/S0019-9958(71)90519-5","volume":"18","author":"J. Gruska","year":"1971","unstructured":"Gruska, J., Complexity and Unambiguity of Context-Free Grammars and Languages, Information and Control 18 (1971) 502\u2013519","journal-title":"Information and Control"},{"key":"22_CR5","unstructured":"Gruska, J., Descriptional Complexity of Context-Free Languages, Proc. MFCS'73, High Tatras, 71\u201383"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01746517","volume":"3","author":"J. E. Hopcroft","year":"1969","unstructured":"Hopcroft, J. E., On the Equivalence and Containment Problems for Context-Free Languages, Math. Syst. Theory 3 (1969) 119\u2013124","journal-title":"Math. Syst. Theory"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0019-9958(67)90564-5","volume":"11","author":"D. E. Knuth","year":"1967","unstructured":"Knuth, D. E., A Characterization of Parenthesis Languages, Information and Control 11 (1967) 269\u2013289","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1977"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08353-7_144.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:52:11Z","timestamp":1619556731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08353-7_144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"ISBN":["9783540083535","9783540372851"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-08353-7_144","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1977]]}}}