{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T17:50:13Z","timestamp":1777053013512,"version":"3.51.4"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031970993","type":"print"},{"value":"9783031971006","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-97100-6_15","type":"book-chapter","created":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T10:08:48Z","timestamp":1751278128000},"page":"211-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Small Balanced Vertex Separators in\u00a0NFA to\u00a0Regular Expression Conversion"],"prefix":"10.1007","author":[{"given":"Derek","family":"Youngman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-02979-0_21","volume-title":"Implementation and Application of Automata","author":"JH Ahn","year":"2009","unstructured":"Ahn, J.H., Han, Y.S.: Implementation of state elimination using heuristics. In: Maneth, S. (ed.) Implementation and Application of Automata, pp. 178\u2013187. Springer, Berlin Heidelberg, Berlin, Heidelberg (2009)"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Almeida, M., Moreira, N., Reis, R.: Enumeration and generation with a string automata representation. Theor. Comput. Sci. 387(2), 93\u2013102 (2007). descriptional Complexity of Formal Systems","DOI":"10.1016\/j.tcs.2007.07.029"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Cioab\u01ce, S., Murty, M.: A First Course in Graph Theory and Combinatorics. Springer Singapore (2022)","DOI":"10.1007\/978-981-19-0957-3"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-540-30500-2_31","volume-title":"Implementation and Application of Automata","author":"M Delgado","year":"2005","unstructured":"Delgado, M., Morais, J.: Approximation to the smallest regular expression for a given regular language. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) Implementation and Application of Automata, pp. 312\u2013314. Springer, Berlin Heidelberg, Berlin, Heidelberg (2005)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejc.2018.02.032","volume":"71","author":"Z Dvo\u0159\u00e1k","year":"2018","unstructured":"Dvo\u0159\u00e1k, Z.: On classes of graphs with strongly sublinear separators. Eur. J. Comb. 71, 1\u201311 (2018)","journal-title":"Eur. J. Comb."},{"issue":"2\u20133","key":"15_CR6","first-page":"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)","journal-title":"J. Autom. Lang. Comb."},{"key":"15_CR7","unstructured":"FAdo. https:\/\/fado.dcc.fc.up.pt\/. Accessed 03 Feb 2025"},{"issue":"08","key":"15_CR8","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(08), 1255\u20131279 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"08","key":"15_CR9","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(08), 1009\u20131040 (2015)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-02979-0_22","volume-title":"Implementation and Application of Automata","author":"H Gruber","year":"2009","unstructured":"Gruber, H., Holzer, M., Tautschnig, M.: Short regular expressions from finite automata: empirical results. In: Maneth, S. (ed.) Implementation and Application of Automata, pp. 188\u2013197. Springer, Berlin Heidelberg, Berlin, Heidelberg (2009)"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.tcs.2006.09.025","volume":"370","author":"YS Han","year":"2007","unstructured":"Han, Y.S., Wood, D.: Obtaining shorter regular expressions from finite-state automata. Theoret. Comput. Sci. 370(1), 110\u2013120 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Han, Y.S., Wood, D.: The generalization of generalized automata: expression automata. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) Implementation and Application of Automata, pp. 156\u2013166. Springer, Heidelberg (2005)","DOI":"10.1007\/978-3-540-30500-2_15"},{"issue":"6","key":"15_CR13","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1137\/0222067","volume":"22","author":"T Jiang","year":"1993","unstructured":"Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Comput. 22(6), 1117\u20131141 (1993)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R Lipton","year":"1979","unstructured":"Lipton, R., Tarjan, R.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36(2), 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Moreira, N., Nabais, D., Reis, R.: State elimination ordering strategies: some experimental results. In: McQuillan, I., Pighizzini, G. (eds.). In: Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, Saskatoon, Canada, 8-10th August 2010. EPTCS, vol.\u00a031, pp. 139\u2013148 (2010)","DOI":"10.4204\/EPTCS.31.16"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511808876"}],"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-031-97100-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T17:31:18Z","timestamp":1777051878000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97100-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031970993","9783031971006"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97100-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"29 June 2025","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":"Loughborough","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.lboro.ac.uk\/departments\/compsci\/events\/dcfs-2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}