{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:22Z","timestamp":1725662902094},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540073895"},{"type":"electronic","value":"9783540375852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07389-2_219","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:55:23Z","timestamp":1330185323000},"page":"344-350","source":"Crossref","is-referenced-by-count":2,"title":["Greibach normal form complexity"],"prefix":"10.1007","author":[{"given":"Alica","family":"Pirick\u00e1-Kelemenov\u00e1","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,21]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/321250.321254","volume":"12","author":"S. A. Greibach","year":"1965","unstructured":"Greibach, S.A., A new normal form theorem for context-free phrase structure grammars. J.Assoc.Comp.Mach. 12(1965), 42\u201352.","journal-title":"J.Assoc.Comp.Mach."},{"key":"42_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. Inf. and Control 14 (1969), 152\u2013179.","journal-title":"Inf. and Control"},{"key":"42_CR3","first-page":"213","volume":"8","author":"J. Gruska","year":"1972","unstructured":"Gruska, J., On the size of context-free grammars. Kybernetika 8 (1972) 213\u2013218.","journal-title":"Kybernetika"},{"key":"42_CR4","first-page":"71","volume":"73","author":"J. Gruska","year":"1973","unstructured":"Gruska, J., Descriptional complexity of context-free languages. Proceedings of MFCS 73 (1973), 71\u201383.","journal-title":"Proceedings of MFCS"},{"key":"42_CR5","unstructured":"Hopcroft, J., Ullman, J., Formal languages and their relation to automata. Addision-Wesley Publishing Co. 1969."},{"key":"42_CR6","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/3-540-07162-8_688","volume":"28","author":"A. Pirick\u00e1","year":"1975","unstructured":"Pirick\u00e1, A., Complexity and Normal forms of CFL. Lecture Notes in Comp. Sci. 28 (1975), 292\u2013297.","journal-title":"Lecture Notes in Comp. Sci."},{"key":"42_CR7","unstructured":"Pirick\u00e1-Kelemenov\u00e1, A., Bounded grammatical complexity of CFL. (submitted for publication)."},{"key":"42_CR8","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/321406.321412","volume":"14","author":"D. Rosenkrantz","year":"1967","unstructured":"Rosenkrantz, D., Matrix equations and normal forms for context-free grammars. J.Assoc.Comput.Mach.14, (1967), 501\u2013507.","journal-title":"J.Assoc.Comput.Mach."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1975 4th Symposium, Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, September 1\u20135, 1975"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07389-2_219.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:46:07Z","timestamp":1619556367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07389-2_219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540073895","9783540375852"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-07389-2_219","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]}}}