{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:22:00Z","timestamp":1757625720271,"version":"3.44.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032026019"},{"type":"electronic","value":"9783032026026"}],"license":[{"start":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:00:00Z","timestamp":1755907200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:00:00Z","timestamp":1755907200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-02602-6_19","type":"book-chapter","created":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T08:33:44Z","timestamp":1755851624000},"page":"267-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["From Regular Expressions to\u00a0Deterministic Finite Automata: $$2^{\\frac{n}{2}+\\sqrt{n}(\\log n)^{\\varTheta (1)}}$$ States Are Necessary and\u00a0Sufficient"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1249-5173","authenticated-orcid":false,"given":"Olga","family":"Martynova","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1615-2725","authenticated-orcid":false,"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,23]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Baker, R.C., Harman, G., Pintz, J.: The difference between consecutive primes, II. Proc. London Math. Soc. 83(3), 532\u2013562 (2001). https:\/\/doi.org\/10.1112\/plms\/83.3.532","DOI":"10.1112\/plms\/83.3.532"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci. 47, 149\u2013158 (1986). https:\/\/doi.org\/10.1016\/0304-3975(86)90142-8","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Edwards, K., Farr, G.: Improved upper bounds for planarization and series-parallelization of degree-bounded graphs. Electron. J. Comb. 19(2), 2378 (2012). https:\/\/doi.org\/10.37236\/2378","DOI":"10.37236\/2378"},{"issue":"2","key":"19_CR4","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."},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Ellul, K., Krawetz, B., Shallit, J., Wang, M.: Regular expressions: new results and open problems. J. Autom. Lang. Comb. 10(4), 407\u2013437 (2005). https:\/\/doi.org\/10.25596\/jalc-2005-407","DOI":"10.25596\/jalc-2005-407"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-22256-6_14","volume-title":"Implementation and Application of Automata","author":"P Gawrychowski","year":"2011","unstructured":"Gawrychowski, P.: Chrobak normal form revisited, with applications. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 142\u2013153. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22256-6_14"},{"issue":"5","key":"19_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"VM Glushkov","year":"1961","unstructured":"Glushkov, V.M.: The abstract theory of automata. Russ. Math. Surv. 16(5), 1\u201353 (1961). https:\/\/doi.org\/10.1070\/RM1961v016n05ABEH004112","journal-title":"Russ. Math. Surv."},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-13089-2_24","volume-title":"Language and Automata Theory and Applications","author":"H Gruber","year":"2010","unstructured":"Gruber, H., Gulan, S.: Simplifying regular expressions. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 285\u2013296. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13089-2_24"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-70583-3_4","volume-title":"Automata, Languages and Programming","author":"H Gruber","year":"2008","unstructured":"Gruber, H., Holzer, M.: Finite automata, digraph connectivity, and regular expression size. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 39\u201350. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_4"},{"issue":"8","key":"19_CR10","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1142\/S0129054113500330","volume":"24","author":"H Gruber","year":"2013","unstructured":"Gruber, H., Holzer, M.: Provably shorter regular expressions from finite automata. Int. J. Found. Comput. Sci. 24(8), 1255\u20131279 (2013). https:\/\/doi.org\/10.1142\/S0129054113500330","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"8","key":"19_CR11","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1142\/S0129054115400110","volume":"26","author":"H Gruber","year":"2015","unstructured":"Gruber, H., Holzer, M.: From finite automata to regular expressions and back\u2013a summary on descriptional complexity. Int. J. Found. Comput. Sci. 26(8), 1009\u20131040 (2015). https:\/\/doi.org\/10.1142\/S0129054115400110","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"19_CR12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1051\/ita:2000116","volume":"34","author":"C Hagenah","year":"2000","unstructured":"Hagenah, C., Muscholl, A.: Computing epsilon-free NFA from regular expressions in $$O(n \\log ^2(n))$$ time. RAIRO Inform. Th\u00e9orique App. 34(4), 257\u2013278 (2000)","journal-title":"RAIRO Inform. Th\u00e9orique App."},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1006\/jcss.2001.1748","volume":"62","author":"J Hromkovi\u010d","year":"2001","unstructured":"Hromkovi\u010d, J., Seibert, S., Wilke, T.: Translating regular expressions into small $$\\epsilon $$-free nondeterministic finite automata. J. Comput. Syst. Sci. 62(4), 565\u2013588 (2001). https:\/\/doi.org\/10.1006\/jcss.2001.1748","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/S0890-5401(03)00090-7","volume":"186","author":"L Ilie","year":"2003","unstructured":"Ilie, L., Yu, S.: Follow automata. Inf. Comput. 186(1), 140\u2013162 (2003)","journal-title":"Inf. Comput."},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/1008861.1008870","volume":"12","author":"EL Leiss","year":"1980","unstructured":"Leiss, E.L.: Constructing a finite automaton for a given regular expression. SIGACT News 12(3), 81\u201387 (1980)","journal-title":"SIGACT News"},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(81)90070-2","volume":"23","author":"EL Leiss","year":"1981","unstructured":"Leiss, E.L.: The complexity of restricted regular expressions and the synthesis problem for finite automata. J. Comput. Syst. Sci. 23(3), 348\u2013354 (1981)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/S0097539793252092","volume":"27","author":"H Leung","year":"1998","unstructured":"Leung, H.: Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata. SIAM J. Comput. 27(4), 1073\u20131082 (1998)","journal-title":"SIAM J. Comput."},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0020-0190(02)00436-2","volume":"85","author":"Y Lifshits","year":"2003","unstructured":"Lifshits, Y.: A lower bound on the size of $$\\epsilon $$-free NFA corresponding to a regular expression. Inf. Process. Lett. 85, 293\u2013299 (2003)","journal-title":"Inf. Process. Lett."},{"key":"19_CR19","unstructured":"Martinez, A.: Efficient computation of regular expressions from unary NFAs. In: Fourth International Workshop on Descriptional Complexity of Formal Systems (DCFS 2002, London, Canada, August 21\u201324, 2002) Department of Computer Science, University of Western Ontario, pp. 174\u2013187 (2002)"},{"issue":"1","key":"19_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"R McNaughton","year":"1960","unstructured":"McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IRE Trans. Elect. Comput. EC. 9(1), 39\u201347 (1960). https:\/\/doi.org\/10.1109\/TEC.1960.5221603","journal-title":"IRE Trans. Elect. Comput. EC."},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/11672142_35","volume-title":"STACS 2006","author":"G Schnitger","year":"2006","unstructured":"Schnitger, G.: Regular expressions and NFAs without $$\\varepsilon $$-transitions. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 432\u2013443. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11672142_35"},{"issue":"6","key":"19_CR22","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K Thompson","year":"1968","unstructured":"Thompson, K.: Regular expression search algorithm. Commun. ACM 11(6), 419\u2013422 (1968). https:\/\/doi.org\/10.1145\/363347.363387","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-02602-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T19:29:50Z","timestamp":1757446190000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-02602-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,23]]},"ISBN":["9783032026019","9783032026026"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-02602-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,23]]},"assertion":[{"value":"23 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciaa2025.unipa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}