{"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":1777053013522,"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_6","type":"book-chapter","created":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T10:08:44Z","timestamp":1751278124000},"page":"79-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two-Word Shuffle: Some Results"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4119-0694","authenticated-orcid":false,"given":"Guilherme","family":"Duarte","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0861-0105","authenticated-orcid":false,"given":"Nelma","family":"Moreira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9668-0917","authenticated-orcid":false,"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"issue":"1\u20132","key":"6_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(00)00433-3","volume":"273","author":"J Berstel","year":"2002","unstructured":"Berstel, J., Boasson, L.: Shuffle factorization is unique. Theor. Comput. Sci. 273(1\u20132), 47\u201367 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(00)00433-3","journal-title":"Theor. Comput. Sci."},{"issue":"38\u201340","key":"6_CR2","doi-asserted-by":"publisher","first-page":"3711","DOI":"10.1016\/J.TCS.2009.04.016","volume":"410","author":"F Biegler","year":"2009","unstructured":"Biegler, F., Daley, M., Holzer, M., McQuillan, I.: On the uniqueness of shuffle on words and finite languages. Theor. Comput. Sci. 410(38\u201340), 3711\u20133724 (2009). https:\/\/doi.org\/10.1016\/J.TCS.2009.04.016","journal-title":"Theor. Comput. Sci."},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Biegler, F., Daley, M., McQuillan, I.: On the shuffle automaton size for words. J. Autom. Lang. Comb. 15(1\/2), 53\u201370 (2010). https:\/\/doi.org\/10.25596\/JALC-2010-053","DOI":"10.25596\/JALC-2010-053"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/J.TCS.2012.04.001","volume":"454","author":"F Biegler","year":"2012","unstructured":"Biegler, F., Daley, M., McQuillan, I.: Algorithmic decomposition of shuffle on words. Theor. Comput. Sci. 454, 38\u201350 (2012). https:\/\/doi.org\/10.1016\/J.TCS.2012.04.001","journal-title":"Theor. Comput. Sci."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/J.TCS.2014.02.013","volume":"528","author":"S Broda","year":"2014","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: A hitchhiker\u2019s guide to descriptional complexity through analytic combinatorics. Theor. Comput. Sci. 528, 85\u2013100 (2014). https:\/\/doi.org\/10.1016\/J.TCS.2014.02.013","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/J.IC.2017.08.013","volume":"259","author":"S Broda","year":"2018","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: Automata for regular expressions with shuffle. Inf. Comput. 259(2), 162\u2013173 (2018). https:\/\/doi.org\/10.1016\/J.IC.2017.08.013","journal-title":"Inf. Comput."},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Brzozowski, J.A., Jir\u00e1skov\u00e1, G., Liu, B., Rajasekaran, A., Szykula, M.: On the state complexity of the shuffle of regular languages. In: C\u00e2mpeanu, C., Manea, F., Shallit, J.O. (eds.) 18th DCFS, 2016. LNCS, vol.\u00a09777, pp. 73\u201386. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-41114-9_6","DOI":"10.1007\/978-3-319-41114-9_6"},{"issue":"3","key":"6_CR8","first-page":"303","volume":"7","author":"C C\u00e2mpeanu","year":"2002","unstructured":"C\u00e2mpeanu, C., Salomaa, K., Yu, S.: Tight lower bound for the state complexity of shuffle of regular languages. J. Autom. Lang. Comb. 7(3), 303\u2013310 (2002)","journal-title":"J. Autom. Lang. Comb."},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Duarte, G., Moreira, N., Prigioniero, L., Reis, R.: Block languages and their bitmap representations. In: Fazekas, S.Z. (ed.) 28th CIAA 2024. LNCS, vol. 15015, pp. 124\u2013137. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-71112-1_9","DOI":"10.1007\/978-3-031-71112-1_9"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Duarte, G., Moreira, N., Prigioniero, L., Reis, R.: Operational state complexity of block languages. In: Manea, F., Pighizzini, G. (eds.) 14th NCMA, 2024. EPTCS, vol.\u00a0407, pp. 59\u201376 (2024). https:\/\/doi.org\/10.4204\/EPTCS.407.5","DOI":"10.4204\/EPTCS.407.5"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/J.IC.2017.09.002","volume":"259","author":"J Eremondi","year":"2018","unstructured":"Eremondi, J., Ibarra, O.H., McQuillan, I.: On the complexity and decidability of some problems involving shuffle. Inf. Comput. 259(2), 214\u2013224 (2018). https:\/\/doi.org\/10.1016\/J.IC.2017.09.002","journal-title":"Inf. Comput."},{"issue":"31\u201333","key":"6_CR12","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\u201333), 2987\u20132998 (2010). https:\/\/doi.org\/10.1016\/J.TCS.2010.04.036","journal-title":"Theor. Comput. Sci."},{"key":"6_CR13","unstructured":"Gruber, H.: On the descriptional and algorithmic complexity of regular languages. Ph.D. thesis, Justus Liebig University Giessen (2010)"},{"key":"6_CR14","doi-asserted-by":"publisher","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.) 35th ICALP, 2008. LNCS, vol.\u00a05126, pp. 39\u201350. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_4","DOI":"10.1007\/978-3-540-70583-3_4"},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(82)90039-7","volume":"4","author":"A Mansfield","year":"1982","unstructured":"Mansfield, A.: An algorithm for a merge recognition problem. Discret. Appl. Math. 4(3), 193\u2013197 (1982). https:\/\/doi.org\/10.1016\/0166-218X(82)90039-7","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0022-0000(84)90018-7","volume":"28","author":"MK Warmuth","year":"1984","unstructured":"Warmuth, M.K., Haussler, D.: On the complexity of iterated shuffle. J. Comput. Syst. Sci. 28(3), 345\u2013358 (1984). https:\/\/doi.org\/10.1016\/0022-0000(84)90018-7","journal-title":"J. Comput. Syst. 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-031-97100-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T17:31:21Z","timestamp":1777051881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97100-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031970993","9783031971006"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97100-6_6","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"}}]}}