{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T06:26:23Z","timestamp":1748413583992,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"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_3","type":"book-chapter","created":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T02:02:50Z","timestamp":1604714570000},"page":"26-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Regular Expression Length via Arithmetic Formula Complexity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7916-6318","authenticated-orcid":false,"given":"Ehud","family":"Cseresnyes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2293-6542","authenticated-orcid":false,"given":"Hannes","family":"Seiwert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,6]]},"reference":[{"issue":"4","key":"3_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"J-C Birget","year":"1992","unstructured":"Birget, J.-C.: Intersection and union of regular languages and state complexity. Inf. Process. Lett. 43(4), 185\u2013190 (1992). https:\/\/doi.org\/10.1016\/0020-0190(92)90198-5","journal-title":"Inf. Process. Lett."},{"issue":"7","key":"3_CR2","doi-asserted-by":"publisher","first-page":"1328","DOI":"10.1016\/j.disc.2007.03.068","volume":"308","author":"Y Chen","year":"2008","unstructured":"Chen, Y.: The Chung-Feller theorem revisited. Discrete Mathematics 308(7), 1328\u20131329 (2008). https:\/\/doi.org\/10.1016\/j.disc.2007.03.068","journal-title":"Discrete Mathematics"},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/S0022-0000(76)80034-7","volume":"12","author":"A Ehrenfeucht","year":"1976","unstructured":"Ehrenfeucht, A., Zeiger, P.: Complexity measures for regular expressions. J. Comput. Syst. Sci. 12(2), 134\u2013146 (1976). https:\/\/doi.org\/10.1016\/S0022-0000(76)80034-7","journal-title":"J. Comput. Syst. Sci."},{"issue":"2\u20133","key":"3_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.25596\/jalc-2004-233","volume":"9","author":"K Ellul","year":"2004","unstructured":"Ellul, K., Krawetz, B., Shallit, J., Wang, M.-W.: Regular expressions: new results and open problems. J. Autom. Lang. Comb. 9(2\u20133), 233\u2013256 (2004). https:\/\/doi.org\/10.25596\/jalc-2004-233","journal-title":"J. Autom. Lang. Comb."},{"issue":"1","key":"3_CR5","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)"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0020-0190(96)00095-6","volume":"59","author":"I Glaister","year":"1996","unstructured":"Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inf. Process. Lett. 59(2), 75\u201377 (1996). https:\/\/doi.org\/10.1016\/0020-0190(96)00095-6","journal-title":"Inf. Process. Lett."},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Gruber, H., Holzer, M.: Finite automata, digraph connectivity, and regular expression size. In: ICALP, pp. 39\u201350. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_4","DOI":"10.1007\/978-3-540-70583-3_4"},{"key":"3_CR8","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":"3_CR9","doi-asserted-by":"publisher","unstructured":"Gruber, H., Johannsen, J.: Optimal lower bounds on regular expression size using communication complexity. In: FoSSaCS, pp. 273\u2013286. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78499-9_20","DOI":"10.1007\/978-3-540-78499-9_20"},{"issue":"7","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1142\/S0129054111008866","volume":"22","author":"M Holzer","year":"2011","unstructured":"Holzer, M., Kutrib, M.: The complexity of regular(-like) expressions. Int. J. Found. Comput. Sci. 22(7), 1533\u20131548 (2011). https:\/\/doi.org\/10.1142\/S0129054111008866","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s00037-011-0007-3","volume":"20","author":"P Hrube\u0161","year":"2011","unstructured":"Hrube\u0161, P., Yehudayoff, A.: Homogeneous formulas and symmetric polynomials. Comput. Complexity 20(3), 559\u2013578 (2011). https:\/\/doi.org\/10.1007\/s00037-011-0007-3","journal-title":"Comput. Complexity"},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1145\/322326.322341","volume":"29","author":"M Jerrum","year":"1982","unstructured":"Jerrum, M., Snir, M.: Some exact complexity results for straight-line computations over semirings. J. ACM 29(3), 874\u2013897 (1982). https:\/\/doi.org\/10.1145\/322326.322341","journal-title":"J. ACM"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Jukna, S.: Boolean Function Complexity: Advances and Frontiers, vol.\u00a027. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-24508-4","DOI":"10.1007\/978-3-642-24508-4"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"2064","DOI":"10.1137\/16M1064738","volume":"30","author":"S Jukna","year":"2016","unstructured":"Jukna, S.: Tropical complexity, sidon sets, and dynamic programming. SIAM J. Discrete Math. 30, 2064\u20132085 (2016). https:\/\/doi.org\/10.1137\/16M1064738","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"3_CR15","first-page":"474","volume":"10","author":"VM Khrapchenko","year":"1971","unstructured":"Khrapchenko, V.M.: Method of determining lower bounds for the complexity of $$P$$-schemes. Math. Notes Acad. Sciences USSR 10(1), 474\u2013479 (1971)","journal-title":"Math. Notes Acad. Sciences USSR"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: 13th Annual Symposium on Switching and Automata Theory, pp. 125\u2013129 (1972). https:\/\/doi.org\/10.1109\/SWAT.1972.29","DOI":"10.1109\/SWAT.1972.29"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Molina Lovett, A., Shallit, J.: Optimal regular expressions for permutations. In: ICALP, pp. 121:1\u201312 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.121","DOI":"10.4230\/LIPIcs.ICALP.2019.121"},{"key":"3_CR18","unstructured":"Mousavi, H.: Lower bounds on regular expression size. CoRR abs\/1712.00811 (2017). http:\/\/arxiv.org\/abs\/1712.00811"},{"issue":"3\u20134","key":"3_CR19","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1561\/0400000039","volume":"5","author":"A Shpilka","year":"2010","unstructured":"Shpilka, A., Yehudayoff, A.: Arithmetic circuits: a survey of recent results and open questions. Found. Trends Theor. Comput. Sci. 5(3\u20134), 207\u2013388 (2010). https:\/\/doi.org\/10.1561\/0400000039","journal-title":"Found. Trends Theor. Comput. Sci."}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T19:22:43Z","timestamp":1741634563000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62536-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030625351","9783030625368"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62536-8_3","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"}}]}}