{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:41:01Z","timestamp":1742967661571,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319946306"},{"type":"electronic","value":"9783319946313"}],"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-94631-3_12","type":"book-chapter","created":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T06:09:52Z","timestamp":1531202992000},"page":"139-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Cover Complexity of Finite Languages"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Hetzl","sequence":"first","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,7,11]]},"reference":[{"issue":"2","key":"12_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(2), 109\u2013115 (1983)","journal-title":"Discrete Appl. Math."},{"key":"12_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. Theor. Comput. Sci. 14, 337\u2013344 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(83)90024-5","volume":"28","author":"W Bucher","year":"1984","unstructured":"Bucher, W., Maurer, H.A., Culik II, K.: Context-free complexity of finite languages. Theor. Comput. Sci. 28, 277\u2013285 (1984)","journal-title":"Theor. Comput. Sci."},{"key":"12_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. Theor. Comput. Sci. 14, 227\u2013246 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-48057-9_4","volume-title":"Automata Implementation","author":"C C\u00e2mpeanu","year":"1999","unstructured":"C\u00e2mpeanu, C., S\u00e2ntean, N., Yu, S.: Minimal cover-automata for finite languages. In: Champarnaud, J.-M., Ziadi, D., Maurel, D. (eds.) WIA 1998. LNCS, vol. 1660, pp. 43\u201356. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48057-9_4"},{"issue":"1\u20132","key":"12_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00292-9","volume":"267","author":"C C\u00e2mpeanu","year":"2001","unstructured":"C\u00e2mpeanu, C., Santean, N., Yu, S.: Minimal cover-automata for finite languages. Theor. Comput. Sci. 267(1\u20132), 3\u201316 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-08353-7_144","volume-title":"Mathematical Foundations of Computer Science 1977","author":"A \u010cern\u00fd","year":"1977","unstructured":"\u010cern\u00fd, A.: Complexity and minimality of context-free grammars and languages. In: Gruska, J. (ed.) MFCS 1977. LNCS, vol. 53, pp. 263\u2013271. Springer, Heidelberg (1977). https:\/\/doi.org\/10.1007\/3-540-08353-7_144"},{"key":"12_CR8","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":"12_CR9","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":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-19225-3_8","volume-title":"Descriptional Complexity of Formal Systems","author":"S Eberhard","year":"2015","unstructured":"Eberhard, S., Hetzl, S.: Compressibility of finite languages by grammars. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 93\u2013104. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19225-3_8"},{"key":"12_CR11","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":"1","key":"12_CR12","first-page":"22","volume":"3","author":"J Gruska","year":"1967","unstructured":"Gruska, J.: On a classification of context-free languages. Kybernetika 3(1), 22\u201329 (1967)","journal-title":"Kybernetika"},{"issue":"2","key":"12_CR13","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. Control 14(2), 152\u2013179 (1969)","journal-title":"Inf. Control"},{"issue":"5","key":"12_CR14","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. Inf. Control 18(5), 502\u2013519 (1971)","journal-title":"Inf. Control"},{"issue":"3","key":"12_CR15","first-page":"213","volume":"8","author":"J Gruska","year":"1972","unstructured":"Gruska, J.: On the size of context-free grammars. Kybernetika 8(3), 213\u2013218 (1972)","journal-title":"Kybernetika"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-28332-1_26","volume-title":"Language and Automata Theory and Applications","author":"S Hetzl","year":"2012","unstructured":"Hetzl, S.: Applying tree languages in proof theory. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 301\u2013312. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28332-1_26"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-319-08587-6_17","volume-title":"Automated Reasoning","author":"S Hetzl","year":"2014","unstructured":"Hetzl, S., Leitsch, A., Reis, G., Tapolczai, J., Weller, D.: Introducing quantified cuts in logic with equality. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS (LNAI), vol. 8562, pp. 240\u2013254. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08587-6_17"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.05.018","volume":"549","author":"S Hetzl","year":"2014","unstructured":"Hetzl, S., Leitsch, A., Reis, G., Weller, D.: Algorithmic introduction of quantified cuts. Theor. Comput. Sci. 549, 1\u201316 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-28717-6_19","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S Hetzl","year":"2012","unstructured":"Hetzl, S., Leitsch, A., Weller, D.: Towards algorithmic cut-introduction. In: Bj\u00f8rner, N., Voronkov, A. (eds.) LPAR 2012. LNCS, vol. 7180, pp. 228\u2013242. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28717-6_19"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-79709-8_4","volume-title":"Computer Science \u2013 Theory and Applications","author":"P Pudl\u00e1k","year":"2008","unstructured":"Pudl\u00e1k, P.: Twelve problems in proof complexity. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol. 5010, pp. 13\u201327. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79709-8_4"},{"issue":"3","key":"12_CR21","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0166-218X(87)80004-5","volume":"18","author":"Z Tuza","year":"1987","unstructured":"Tuza, Z.: On the context-free production complexity of finite languages. Discrete Appl. Math. 18(3), 293\u2013304 (1987)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94631-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:16:23Z","timestamp":1710324983000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94631-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946306","9783319946313"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94631-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"11 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Halifax, NS","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.smu.ca\/~dcfs2018\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}