{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:52:31Z","timestamp":1742914351190,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031332630"},{"type":"electronic","value":"9783031332647"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33264-7_7","type":"book-chapter","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:03:26Z","timestamp":1684397006000},"page":"74-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Exact State Complexity for\u00a0the\u00a0Composition of\u00a0Root and\u00a0Reversal"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Caron","sequence":"first","affiliation":[]},{"given":"Alexandre","family":"Durand","sequence":"additional","affiliation":[]},{"given":"Bruno","family":"Patrou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,19]]},"reference":[{"key":"7_CR1","unstructured":"Mirkin, B.G.: On dual automata. Kibernetica 2(1), 7\u201310 (1966). http:\/\/www.academia.edu\/download\/46550561\/bf0107224720160616-14181-oqti80.pdf"},{"key":"7_CR2","first-page":"321","volume":"9","author":"OB Lupanov","year":"1963","unstructured":"Lupanov, O.B.: A comparison of two types of finite automata. Probl. Kibernetiki 9, 321\u2013326 (1963)","journal-title":"Probl. Kibernetiki"},{"key":"7_CR3","first-page":"1373","volume":"11","author":"AN Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Soviet Math. Dokl. 11, 1373\u20131375 (1970)","journal-title":"Soviet Math. Dokl."},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1142\/S0129054105003157","volume":"16","author":"B Krawetz","year":"2005","unstructured":"Krawetz, B., Lawrence, J., Shallit, J.: State complexity and the monoid of transformations of a finite set. Int. J. Found. Comput. Sci. 16(3), 547\u2013563 (2005). https:\/\/doi.org\/10.1142\/S0129054105003157","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2\u20133","key":"7_CR5","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.tcs.2007.04.015","volume":"383","author":"A Salomaa","year":"2007","unstructured":"Salomaa, A., Salomaa, K., Yu, S.: State complexity of combined operations. Theor. Comput. Sci. 383(2\u20133), 140\u2013152 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.04.015","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.3233\/FI-2011-502","volume":"109","author":"G Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G., Okhotin, A.: On the state complexity of star of union and star of intersection. Fundam. Inform. 109(2), 161\u2013178 (2011). https:\/\/doi.org\/10.3233\/FI-2011-502","journal-title":"Fundam. Inform."},{"issue":"9\u201310","key":"7_CR7","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.1016\/j.ic.2008.03.018","volume":"206","author":"G Liu","year":"2008","unstructured":"Liu, G., Mart\u00edn-Vide, C., Salomaa, A., Yu, S.: State complexity of basic language operations combined with reversal. Inf. Comput. 206(9\u201310), 1178\u20131186 (2008). https:\/\/doi.org\/10.1016\/j.ic.2008.03.018","journal-title":"Inf. Comput."},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Caron, P., Hamel-De le Court, E., Luque, J.-G.: Combination of roots and Boolean operations: an application to state complexity. Inf. Comput. 289(Part), 104961 (2022). https:\/\/doi.org\/10.1016\/j.ic.2022.104961","DOI":"10.1016\/j.ic.2022.104961"},{"key":"7_CR9","first-page":"3","volume":"34","author":"SC Kleene","year":"1956","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. Automata Stud. Ann. Math. Stud. 34, 3\u201341 (1956)","journal-title":"Automata Stud. Ann. Math. Stud."},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"S Yu","year":"1994","unstructured":"Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular languages. Theor. Comput. Sci. 125(2), 315\u2013328 (1994). https:\/\/doi.org\/10.1016\/0304-3975(92)00011-F","journal-title":"Theor. Comput. Sci."},{"key":"7_CR11","unstructured":"Caron, P., Hamel-De le Court, E., Luque, J.-G., Patrou, B.: New tools for state complexity, Discret. Math. Theor. Comput. Sci. 22(1) (2020). http:\/\/dmtcs.episciences.org\/6179"},{"key":"7_CR12","unstructured":"Caron, P., Hamel-De le Court, E., Luque, J.-G.: State complexity of the star of a Boolean operation. CoRR abs\/2206.05100 (2022). https:\/\/doi.org\/10.48550\/arXiv.2206.05100"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-319-98654-8_21","volume-title":"Developments in Language Theory","author":"S Davies","year":"2018","unstructured":"Davies, S.: A general approach to state complexity of operations: formalization and limitations. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 256\u2013268. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98654-8_21"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Ganyushkin, O., Mazorchuk, V.: Classical Finite Transformation Semigroups: An Introduction. Algebra and Applications, Springer, Dordrecht (2009). https:\/\/doi.org\/10.1007\/978-1-84800-281-4","DOI":"10.1007\/978-1-84800-281-4"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33264-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:04:18Z","timestamp":1684397058000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33264-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332630","9783031332647"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33264-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dltwords2023.cs.umu.se\/dlt","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":"32","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":"19","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":"59% - 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":"6","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)"}},{"value":"4- Invited papers and 32 submissions (31 regular ones and one invited)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}