{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:25:00Z","timestamp":1742912700769,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98654-8_28","type":"book-chapter","created":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T19:43:57Z","timestamp":1533411837000},"page":"342-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Minimal Grammar Problems for Finite Languages"],"prefix":"10.1007","author":[{"given":"Hermann","family":"Gruber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Holzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Wolfsteiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,5]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0166-218X(83)90064-1","volume":"6","author":"B Alspach","year":"1983","unstructured":"Alspach, B., Eades, P., Rose, G.: A lower-bound for the number of productions required for a certain class of languages. Discrete Appl. Math. 6, 109\u2013115 (1983)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(81)90050-5","volume":"14","author":"W Bucher","year":"1981","unstructured":"Bucher, W.: A note on a problem in the theory of grammatical complexity. Theoret. Comput. Sci. 14(3), 337\u2013344 (1981)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"28_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(83)90024-5","volume":"28","author":"W Bucher","year":"1983","unstructured":"Bucher, W., Maurer, H.A., Culik II, K.: Context-free complexity of finite languages. Theoret. Comput. Sci. 28(3), 277\u2013285 (1983)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"28_CR4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0304-3975(81)90044-X","volume":"14","author":"W Bucher","year":"1981","unstructured":"Bucher, W., Maurer, H.A., Culik II, K., Wotschke, D.: Concise description of finite languages. Theoret. Comput. Sci. 14(3), 227\u2013246 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR5","unstructured":"Casel, K., Fernau, H., Gaspers, S., Gras, B., Schmid, M.L.: On the complexity of grammar-based compression over fixed alphabets. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, volume 55 of LIPIcs, Rome, Italy, pp. 122:1\u2013122:14. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2016)"},{"issue":"7","key":"28_CR6","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1109\/TIT.2005.850116","volume":"51","author":"M Charikar","year":"2005","unstructured":"Charikar, M., et al.: The smallest grammar problem. IEEE Trans. Inf. Theory 51(7), 2554\u20132576 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-60252-3_3","volume-title":"Descriptional Complexity of Formal Systems","author":"J Dassow","year":"2017","unstructured":"Dassow, J.: Descriptional complexity and operations \u2013 two non-classical cases. In: Pighizzini, G., C\u00e2mpeanu, C. (eds.) DCFS 2017. LNCS, vol. 10316, pp. 33\u201344. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60252-3_3"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-31623-4_11","volume-title":"Descriptional Complexity of Formal Systems","author":"J Dassow","year":"2012","unstructured":"Dassow, J., Harbich, R.: Production complexity of some operations on context-free languages. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol. 7386, pp. 141\u2013154. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31623-4_11"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.ic.2017.09.001","volume":"259","author":"S Eberhard","year":"2018","unstructured":"Eberhard, S., Hetzl, S.: On the compressibility of finite languages and formal proofs. Inf. Comput. 259, 191\u2013213 (2018)","journal-title":"Inf. Comput."},{"issue":"18","key":"28_CR10","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1016\/j.ipl.2011.06.006","volume":"111","author":"Y Filmus","year":"2011","unstructured":"Filmus, Y.: Lower bounds for context-free grammars. Inform. Process. Lett. 111(18), 895\u2013898 (2011)","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"28_CR11","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1145\/321186.321191","volume":"10","author":"S Ginsburg","year":"1963","unstructured":"Ginsburg, S., Spanier, E.H.: Quotients of context-free languages. J. ACM 10(4), 487\u2013492 (1963)","journal-title":"J. ACM"},{"key":"28_CR12","volume-title":"Introduction to Formal Language Theory","author":"MA Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Boston (1978)"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Holzer, M., Kutrib, M.: Descriptional complexity\u2013an introductory survey. In: Mart\u00edn-Vide, C. (ed.) Scientific Applications of Language Methods, pp. 1\u201358. World Scientific (2010)","DOI":"10.1142\/9781848165458_0001"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Hunt III, H.B.: On the time and tape complexity of languages. Ph.D. thesis, Cornell University, Ithaca, New York, USA (1973)","DOI":"10.1145\/800125.804030"},{"issue":"1","key":"28_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"CA Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified NP-complete satisfiability problem. Discrete Appl. Math. 8(1), 85\u201389 (1984)","journal-title":"Discrete Appl. Math."},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Tuza, Zs.: On the context-free production complexity of finite languages. Discrete Appl. Math. 18(3), 293\u2013304 (1987)","DOI":"10.1016\/S0166-218X(87)80004-5"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98654-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T17:27:35Z","timestamp":1571678855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98654-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98654-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}