{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:23:14Z","timestamp":1743060194064,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030625351"},{"type":"electronic","value":"9783030625368"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-62536-8_15","type":"book-chapter","created":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T02:02:50Z","timestamp":1604714570000},"page":"180-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Operational Complexity of Straight Line Programs for Regular Languages"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2293-6542","authenticated-orcid":false,"given":"Hannes","family":"Seiwert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,6]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.ic.2016.06.005","volume":"253","author":"Z Bedn\u00e1rov\u00e1","year":"2017","unstructured":"Bedn\u00e1rov\u00e1, Z., Geffert, V.: Two double-exponential gaps for automata with a limited pushdown. Inf. Comput. 253, 381\u2013398 (2017). https:\/\/doi.org\/10.1016\/j.ic.2016.06.005","journal-title":"Inf. Comput."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2012.05.009","volume":"449","author":"Z Bedn\u00e1rov\u00e1","year":"2012","unstructured":"Bedn\u00e1rov\u00e1, Z., Geffert, V., Mereghetti, C., Palano, B.: The size-cost of boolean operations on constant height deterministic pushdown automata. Theor. Comput. Sci. 449, 23\u201336 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.05.009","journal-title":"Theor. Comput. Sci."},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.ic.2014.03.002","volume":"237","author":"Z Bedn\u00e1rov\u00e1","year":"2014","unstructured":"Bedn\u00e1rov\u00e1, Z., Geffert, V., Mereghetti, C., Palano, B.: Removing nondeterminism in constant height pushdown automata. Inf. Comput. 237, 257\u2013267 (2014). https:\/\/doi.org\/10.1016\/j.ic.2014.03.002","journal-title":"Inf. Comput."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.jcss.2017.06.007","volume":"90","author":"Z Bedn\u00e1rov\u00e1","year":"2017","unstructured":"Bedn\u00e1rov\u00e1, Z., Geffert, V., Mereghetti, C., Palano, B.: Boolean language operations on nondeterministic automata with a pushdown of constant height. J. Comput. Syst. Sci. 90, 99\u2013114 (2017). https:\/\/doi.org\/10.1016\/j.jcss.2017.06.007","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0019-9958(59)90362-6","volume":"2","author":"N Chomsky","year":"1959","unstructured":"Chomsky, N.: On certain formal properties of grammars. Inf. Control. 2(2), 137\u2013167 (1959). https:\/\/doi.org\/10.1016\/S0019-9958(59)90362-6","journal-title":"Inf. Control."},{"issue":"18","key":"15_CR6","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. Inf. Process. Lett. 111(18), 895\u2013898 (2011). https:\/\/doi.org\/10.1016\/j.ipl.2011.06.006","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.25596\/jalc-2016-251","volume":"21","author":"Y Gao","year":"2016","unstructured":"Gao, Y., Moreira, N., Reis, R., Yu, S.: A survey on operational state complexity. J. Autom. Lang. Comb. 21(4), 251\u2013310 (2016). https:\/\/doi.org\/10.25596\/jalc-2016-251","journal-title":"J. Autom. Lang. Comb."},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.ic.2010.01.002","volume":"208","author":"V Geffert","year":"2010","unstructured":"Geffert, V., Mereghetti, C., Palano, B.: More concise representation of regular languages by automata and regular expressions. Inf. Comput. 208(4), 385\u2013394 (2010). https:\/\/doi.org\/10.1016\/j.ic.2010.01.002","journal-title":"Inf. Comput."},{"issue":"31","key":"15_CR9","doi-asserted-by":"publisher","first-page":"2987","DOI":"10.1016\/j.tcs.2010.04.036","volume":"411","author":"W Gelade","year":"2010","unstructured":"Gelade, W.: Succinctness of regular expressions with interleaving, intersection and counting. Theor. Comput. Sci. 411(31), 2987\u20132998 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2010.04.036","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/2071368.2071372","volume":"13","author":"W Gelade","year":"2012","unstructured":"Gelade, W., Neven, F.: Succinctness of the complement and intersection of regular expressions. ACM Trans. Comput. Logic (TOCL) 13(1), 4 (2012). https:\/\/doi.org\/10.1145\/2071368.2071372","journal-title":"ACM Trans. Comput. Logic (TOCL)"},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Gruber, H., Holzer, M.: Finite automata, digraph connectivity, and regular expression size. In: ICALP, pp. 39\u201350 (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_4","DOI":"10.1007\/978-3-540-70583-3_4"},{"issue":"35","key":"15_CR12","doi-asserted-by":"publisher","first-page":"3281","DOI":"10.1016\/j.tcs.2009.04.009","volume":"410","author":"H Gruber","year":"2009","unstructured":"Gruber, H., Holzer, M.: Language operations with regular expressions of polynomial size. Theor. Comput. Sci. 410(35), 3281\u20133289 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.04.009","journal-title":"Theor. Comput. Sci."},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"Gruber, H., Holzer, M.: Tight bounds on the descriptional complexity of regular expressions. In: Developments in Language Theory, pp. 276\u2013287. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02737-6_22","DOI":"10.1007\/978-3-642-02737-6_22"},{"key":"15_CR14","doi-asserted-by":"publisher","unstructured":"Guillon, B., Pighizzini, G., Prigioniero, L.: Non-self-embedding grammars, constant-height pushdown automata, and limited automata. In: CIAA, pp. 186\u2013197 (2018). https:\/\/doi.org\/10.1007\/978-3-319-94812-6_16","DOI":"10.1007\/978-3-319-94812-6_16"},{"key":"15_CR15","doi-asserted-by":"publisher","unstructured":"Hrubes, P., Wigderson, A., Yehudayoff, A.: Non-commutative circuits and the sum-of-squares problem. In: STOC, pp. 667\u2013676 (2010). https:\/\/doi.org\/10.1145\/1806689.1806781","DOI":"10.1145\/1806689.1806781"},{"key":"15_CR16","doi-asserted-by":"publisher","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time: preliminary report. In: STOC, pp. 1\u20139 (1973). https:\/\/doi.org\/10.1145\/800125.804029","DOI":"10.1145\/800125.804029"}],"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-030-62536-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T19:22:42Z","timestamp":1741634562000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62536-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030625351","9783030625368"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62536-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 November 2020","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":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sofl2020.conf.tuwien.ac.at\/DCFS2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}