{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:12:40Z","timestamp":1762459960278,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030681944"},{"type":"electronic","value":"9783030681951"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-68195-1_4","type":"book-chapter","created":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:04:27Z","timestamp":1613952267000},"page":"43-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Location Based Automata for Expressions with Shuffle"],"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":[[2021,2,22]]},"reference":[{"issue":"2","key":"4_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."},{"key":"4_CR2","unstructured":"Asperti, A., Coen, C.S., Tassi, E.: Regular expressions, au point. CoRR abs\/1010.2604 (2010)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ic.2019.01.003","volume":"265","author":"S Broda","year":"2019","unstructured":"Broda, S., Holzer, M., Maia, E., Moreira, N., Reis, R.: A mesh of automata. Inf. Comput. 265, 94\u2013111 (2019)","journal-title":"Inf. Comput."},{"issue":"2","key":"4_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."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0304-3975(93)90287-4","volume":"48","author":"A Br\u00fcggemann-Klein","year":"1993","unstructured":"Br\u00fcggemann-Klein, A.: Regular expressions into finite automata. Theoret. Comput. Sci. 48, 197\u2013213 (1993)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J Brzozowski","year":"1964","unstructured":"Brzozowski, J.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964)","journal-title":"J. ACM"},{"key":"4_CR7","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":"4_CR8","doi-asserted-by":"crossref","unstructured":"Estrade, B.D., Perkins, A.L., Harris, J.M.: Explicitly parallel regular expressions. In: Ni, J., Dongarra, J. (eds.) 1st IMSCCS, pp. 402\u2013409. IEEE (2006)","DOI":"10.1109\/IMSCCS.2006.60"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0304-3975(92)90339-H","volume":"96","author":"V Garg","year":"1992","unstructured":"Garg, V., Ragunath, M.: Concurrent regular expressions and their relationship to Petri nets. Theoret. Comput. Sci. 96(2), 285\u2013304 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR10","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, 1\u201353 (1961)","journal-title":"Russ. Math. Surv."},{"issue":"1","key":"4_CR11","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."},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-319-20028-6_26","volume-title":"Evolving Computability","author":"E Maia","year":"2015","unstructured":"Maia, E., Moreira, N., Reis, R.: Prefix and right-partial derivative automata. In: Beckmann, A., Mitrana, V., Soskova, M. (eds.) CiE 2015. LNCS, vol. 9136, pp. 258\u2013267. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20028-6_26"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1006\/inco.1994.1098","volume":"115","author":"AJ Mayer","year":"1994","unstructured":"Mayer, A.J., Stockmeyer, L.J.: Word problems-this time with interleaving. Inf. Comput. 115(2), 293\u2013311 (1994)","journal-title":"Inf. Comput."},{"key":"4_CR14","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. IEEE Trans. Comput. 9, 39\u201347 (1960)","journal-title":"IEEE Trans. Comput."},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-319-08970-6_29","volume-title":"Interactive Theorem Proving","author":"T Nipkow","year":"2014","unstructured":"Nipkow, T., Traytel, D.: Unified decision procedures for regular expression equivalence. In: Klein, G., Gamboa, R. (eds.) ITP 2014. LNCS, vol. 8558, pp. 450\u2013466. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08970-6_29"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-15579-1_21","volume-title":"Language and Automata Theory and Applications","author":"M Sulzmann","year":"2015","unstructured":"Sulzmann, M., Thiemann, P.: Derivatives for regular shuffle expressions. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 275\u2013286. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15579-1_21"},{"key":"4_CR17","unstructured":"Yamamoto, H.: A new finite automaton construction for regular expressions. In: Bensch, S., Freund, R., Otto, F. (eds.) 6th NCMA. books@ocg.at, vol. 304, pp. 249\u2013264. \u00d6sterreichische Computer Gesellschaft (2014)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68195-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,10]],"date-time":"2021-03-10T09:06:37Z","timestamp":1615367197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-68195-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030681944","9783030681951"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68195-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/irdta.eu\/lata2020&2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}