{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T04:09:22Z","timestamp":1751342962830,"version":"3.41.0"},"publisher-location":"Cham","reference-count":15,"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_5","type":"book-chapter","created":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T14:08:45Z","timestamp":1751292525000},"page":"64-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automata for\u00a0Synchronised Shuffle on\u00a0Backbones"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3798-9348","authenticated-orcid":false,"given":"Sabine","family":"Broda","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7595-7275","authenticated-orcid":false,"given":"Ant\u00f3nio","family":"Machiavelo","sequence":"additional","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":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"VM Antimirov","year":"1996","unstructured":"Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci. 155(2), 291\u2013319 (1996)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"5_CR2","first-page":"5","volume":"22","author":"R Bastos","year":"2017","unstructured":"Bastos, R., Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the average complexity of partial derivative automata for semi-extended expressions. J. Autom. Lang. Comb. 22(1\u20133), 5\u201328 (2017)","journal-title":"J. Autom. Lang. Comb."},{"issue":"5","key":"5_CR3","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1142\/S0129054112400400","volume":"23","author":"S Broda","year":"2012","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the average size of Glushkov and partial derivative automata. Int. J. Found. Comput. Sci. 23(5), 969\u2013984 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"5_CR4","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)","journal-title":"Inf. Comput."},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/3388392.3388401","volume":"51","author":"S Broda","year":"2020","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: Analytic combinatorics and descriptional complexity of regular languages on average. ACM SIGACT News 51(1), 38\u201356 (2020)","journal-title":"ACM SIGACT News"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: Average complexity of partial derivatives for synchronised shuffle expressions. In: Nagy, B., (ed.), 27th CIAA, volume 14151 of LNCS, pp. 103\u2013115. Springer (2023)","DOI":"10.1007\/978-3-031-40247-0_7"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: Location automata for synchronised shuffle expressions. J. Log. Algebr. Program.133 (2023)","DOI":"10.1016\/j.jlamp.2023.100847"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"104917","DOI":"10.1016\/j.ic.2022.104917","volume":"295","author":"S Broda","year":"2023","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: Location based automata for expressions with shuffle and intersection. Inf. Comput. 295, 104917 (2023)","journal-title":"Inf. Comput."},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.3233\/FUN-2001-45303","volume":"45","author":"JM Champarnaud","year":"2001","unstructured":"Champarnaud, J.M., Ziadi, D.: From Mirkin\u2019s prebases to Antimirov\u2019s word partial derivatives. Fundam. Inform. 45(3), 195\u2013205 (2001)","journal-title":"Fundam. Inform."},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0304-3975(01)00267-5","volume":"289","author":"JM Champarnaud","year":"2002","unstructured":"Champarnaud, J.M., Ziadi, D.: Canonical derivatives, partial derivatives and finite automaton constructions. Theoret. Comput. Sci. 289, 137\u2013163 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. CUP (2008)","DOI":"10.1017\/CBO9780511801655"},{"issue":"1\u20132","key":"5_CR12","first-page":"191","volume":"73","author":"F Manea","year":"2006","unstructured":"Manea, F., Mitrana, V., Voinescu, D.-C.: Synchronized shuffle on backbones. Fundam. Inform 73(1\u20132), 191\u2013202 (2006)","journal-title":"Inform"},{"key":"5_CR13","first-page":"51","volume":"5","author":"BG Mirkin","year":"1966","unstructured":"Mirkin, B.G.: An algorithm for constructing a base in a language of regular expressions. Eng. Cybern. 5, 51\u201357 (1966)","journal-title":"Eng. Cybern."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.jcss.2016.11.010","volume":"104","author":"M Sulzmann","year":"2019","unstructured":"Sulzmann, M., Thiemann, P.: Derivatives and partial derivatives for regular shuffle expressions. J. Comput. Syst. Sci. 104, 323\u2013341 (2019)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.tcs.2005.04.007","volume":"341","author":"MH ter Beek","year":"2005","unstructured":"ter Beek, M.H., Mart\u00edn-Vide, C., Mitrana, V.: Synchronized shuffles. Theoret. Comput. Sci. 341, 263\u2013275 (2005)","journal-title":"Theoret. 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-031-97100-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T14:08:47Z","timestamp":1751292527000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97100-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031970993","9783031971006"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97100-6_5","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"}}]}}