{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:23:05Z","timestamp":1742952185569,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031521126"},{"type":"electronic","value":"9783031521133"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-52113-3_22","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"311-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automata Classes Accepting Languages Whose Commutative Closure is Regular"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7866-075X","authenticated-orcid":false,"given":"Stefan","family":"Hoffmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(91)90268-7","volume":"91","author":"M Arfi","year":"1991","unstructured":"Arfi, M.: Op\u00e9rations polynomiales et hi\u00e9rarchies de concat\u00e9nation. Theoret. Comput. Sci. 91(1), 71\u201384 (1991). https:\/\/doi.org\/10.1016\/0304-3975(91)90268-7","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"22_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1062","volume":"113","author":"M Beaudry","year":"1994","unstructured":"Beaudry, M.: Membership testing in threshold one transformation monoids. Inf. Comput. 113(1), 1\u201325 (1994). https:\/\/doi.org\/10.1006\/inco.1994.1062","journal-title":"Inf. Comput."},{"issue":"8","key":"22_CR3","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1142\/S0129054120420058","volume":"31","author":"MV Berlinkov","year":"2020","unstructured":"Berlinkov, M.V., Nicaud, C.: Synchronizing almost-group automata. Int. J. Found. Comput. Sci. 31(8), 1091\u20131112 (2020). https:\/\/doi.org\/10.1142\/S0129054120420058","journal-title":"Int. J. Found. Comput. Sci."},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-68195-1_1","volume-title":"Language and Automata Theory and Applications","author":"F Birkmann","year":"2021","unstructured":"Birkmann, F., Milius, S., Urbat, H.: On language varieties without boolean operations. In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2021. LNCS, vol. 12638, pp. 3\u201315. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68195-1_1"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ic.2005.11.007","volume":"205","author":"A Bouajjani","year":"2007","unstructured":"Bouajjani, A., Muscholl, A., Touili, T.: Permutation rewriting and algorithmic verification. Inf. Comput. 205(2), 199\u2013224 (2007). https:\/\/doi.org\/10.1016\/j.ic.2005.11.007","journal-title":"Inf. Comput."},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Cameron, P.J.: Permutation Groups. London Mathematical Society Student Texts. Cambridge University Press, Cambridge (1999). https:\/\/doi.org\/10.1017\/CBO9780511623677","DOI":"10.1017\/CBO9780511623677"},{"issue":"1\u20132","key":"22_CR7","doi-asserted-by":"publisher","first-page":"7","DOI":"10.3166\/tsi.27.7-28","volume":"27","author":"G C\u00e9c\u00e9","year":"2008","unstructured":"C\u00e9c\u00e9, G., H\u00e9am, P., Mainier, Y.: Cl\u00f4tures transitives de semi-commutations et model-checking r\u00e9gulier. Technique et Science Informatiques 27(1\u20132), 7\u201328 (2008). https:\/\/doi.org\/10.3166\/tsi.27.7-28","journal-title":"Technique et Science Informatiques"},{"issue":"2","key":"22_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1051\/ITA:2007029","volume":"42","author":"G C\u00e9c\u00e9","year":"2008","unstructured":"C\u00e9c\u00e9, G., H\u00e9am, P., Mainier, Y.: Efficiency of automata in semi-commutation verification techniques. RAIRO Theor. Inform. Appl. 42(2), 197\u2013215 (2008). https:\/\/doi.org\/10.1051\/ITA:2007029","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0890-5401(87)90040-X","volume":"73","author":"M Clerbout","year":"1987","unstructured":"Clerbout, M., Latteux, M.: Semi-commutations. Inf. Comput. 73(1), 59\u201374 (1987). https:\/\/doi.org\/10.1016\/0890-5401(87)90040-X","journal-title":"Inf. Comput."},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0022-0000(71)80003-X","volume":"5","author":"RS Cohen","year":"1971","unstructured":"Cohen, R.S., Brzozowski, J.A.: Dot-depth of star-free events. J. Comput. Syst. Sci. 5(1), 1\u201316 (1971). https:\/\/doi.org\/10.1016\/S0022-0000(71)80003-X","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"22_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1051\/ita\/1985190100211","volume":"19","author":"R Cori","year":"1985","unstructured":"Cori, R., Perrin, D.: Automates et commutations partielles. RAIRO Theor. Inform. Appl. 19(1), 21\u201332 (1985). https:\/\/doi.org\/10.1051\/ita\/1985190100211","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995). https:\/\/doi.org\/10.1142\/2563","DOI":"10.1142\/9789814261456"},{"issue":"5","key":"22_CR13","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.2307\/2036087","volume":"17","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Bounded regular sets. Proc. Am. Math. Soc. 17(5), 1043\u20131049 (1966). https:\/\/doi.org\/10.2307\/2036087","journal-title":"Proc. Am. Math. Soc."},{"issue":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pac. J. Math. 16(2), 285\u2013296 (1966). https:\/\/doi.org\/10.2140\/pjm.1966.16.285","journal-title":"Pac. J. Math."},{"issue":"4","key":"22_CR15","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0022-0000(71)80024-7","volume":"5","author":"S Ginsburg","year":"1971","unstructured":"Ginsburg, S., Spanier, E.H.: AFL with the semilinear property. J. Comput. Syst. Sci. 5(4), 365\u2013396 (1971). https:\/\/doi.org\/10.1016\/S0022-0000(71)80024-7","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(85)90059-3","volume":"41","author":"P Gohon","year":"1985","unstructured":"Gohon, P.: An algorithm to decide whether a rational subset of $${N}^k$$ is recognizable. Theoret. Comput. Sci. 41, 51\u201359 (1985). https:\/\/doi.org\/10.1016\/0304-3975(85)90059-3","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.ic.2013.07.003","volume":"230","author":"AC G\u00f3mez","year":"2013","unstructured":"G\u00f3mez, A.C., Guaiana, G., Pin, J.\u00c9.: Regular languages and partial commutations. Inf. Comput. 230, 76\u201396 (2013). https:\/\/doi.org\/10.1016\/j.ic.2013.07.003","journal-title":"Inf. Comput."},{"issue":"2\u20133","key":"22_CR18","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.tcs.2003.10.034","volume":"312","author":"AC G\u00f3mez","year":"2004","unstructured":"G\u00f3mez, A.C., Pin, J.: Shuffle on positive varieties of languages. Theoret. Comput. Sci. 312(2\u20133), 433\u2013461 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2003.10.034","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"22_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.25596\/jalc-2004-061","volume":"9","author":"G Guaiana","year":"2004","unstructured":"Guaiana, G., Restivo, A., Salemi, S.: On the trace product and some families of languages closed under partial commutations. J. Autom. Lang. Comb. 9(1), 61\u201379 (2004). https:\/\/doi.org\/10.25596\/jalc-2004-061","journal-title":"J. Autom. Lang. Comb."},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-030-79121-6_5","volume-title":"Implementation and Application of Automata","author":"S Hoffmann","year":"2021","unstructured":"Hoffmann, S.: The commutative closure of shuffle languages over group languages is regular. In: Maneth, S. (ed.) CIAA 2021. LNCS, vol. 12803, pp. 53\u201364. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79121-6_5"},{"issue":"08","key":"22_CR21","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1142\/S0129054123430037","volume":"34","author":"S Hoffmann","year":"2023","unstructured":"Hoffmann, S.: Regularity conditions for iterated shuffle on commutative regular languages. Int. J. Found. Comput. Sci. 34(08), 923\u2013957 (2023). https:\/\/doi.org\/10.1142\/S0129054123430037","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1\u20133","key":"22_CR22","doi-asserted-by":"publisher","first-page":"27","DOI":"10.25596\/JALC-2023-027","volume":"28","author":"S Hoffmann","year":"2023","unstructured":"Hoffmann, S.: State complexity bounds for the commutative closure of group languages. J. Autom. Lang. Comb. 28(1\u20133), 27\u201357 (2023). https:\/\/doi.org\/10.25596\/JALC-2023-027","journal-title":"J. Autom. Lang. Comb."},{"issue":"08","key":"22_CR23","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1142\/S0129054123430025","volume":"34","author":"S Hoffmann","year":"2023","unstructured":"Hoffmann, S.: State complexity of permutation and the language inclusion problem up to parikh equivalence on alphabetical pattern constraints and partially ordered nfas. Int. J. Found. Comput. Sci. 34(08), 959\u2013986 (2023). https:\/\/doi.org\/10.1142\/S0129054123430025","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"22_CR24","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"OH Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. ACM 25(1), 116\u2013133 (1978). https:\/\/doi.org\/10.1145\/322047.322058","journal-title":"J. ACM"},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/3-540-45061-0_54","volume-title":"Automata, Languages and Programming","author":"F Klaedtke","year":"2003","unstructured":"Klaedtke, F., Rue\u00df, H.: Monadic second-order logics with cardinalities. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 681\u2013696. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_54"},{"issue":"2\u20133","key":"22_CR26","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.tcs.2005.09.018","volume":"348","author":"M Kunc","year":"2005","unstructured":"Kunc, M.: Regular solutions of language inequalities and well quasi-orders. Theoret. Comput. Sci. 348(2\u20133), 277\u2013293 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.09.018","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"22_CR27","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0022-0000(79)90039-4","volume":"18","author":"M Latteux","year":"1979","unstructured":"Latteux, M.: C\u00f4nes rationnels commutatifs. J. Comput. Syst. Sci. 18(3), 307\u2013333 (1979). https:\/\/doi.org\/10.1016\/0022-0000(79)90039-4","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR28","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01069078","volume":"9","author":"Commutative closures of regular semigroups of languages","year":"1973","unstructured":"Commutative closures of regular semigroups of languages: L\u2019vov, M. Cybern. Syst. Anal. (Cybern.) 9, 247\u2013252 (1973). https:\/\/doi.org\/10.1007\/BF01069078. translated (original in Russian) from Kibernetika (Kiev), No. 2, pp. 54\u201358, March-April, 1973","journal-title":"Cybern. Syst. Anal. (Cybern.)"},{"issue":"2","key":"22_CR29","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0020-0190(95)00187-5","volume":"57","author":"A Muscholl","year":"1996","unstructured":"Muscholl, A., Petersen, H.: A note on the commutative closure of star-free languages. Inf. Process. Lett. 57(2), 71\u201374 (1996). https:\/\/doi.org\/10.1016\/0020-0190(95)00187-5","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"22_CR30","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R Parikh","year":"1966","unstructured":"Parikh, R.: On context-free languages. J. ACM 13(4), 570\u2013581 (1966). https:\/\/doi.org\/10.1145\/321356.321364","journal-title":"J. ACM"},{"key":"22_CR31","doi-asserted-by":"crossref","unstructured":"Pin, J.\u00c9.: PG = BG, a success story. In: Fountain, J. (ed.) NATO Advanced Study Institute, Semigroups, Formal Languages and Groups, pp. 33\u201347. Kluwer Academic Publishers (1995)","DOI":"10.1007\/978-94-011-0149-3_2"},{"key":"22_CR32","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-642-59136-5_10","volume-title":"Handbook of Formal Languages","author":"J-E Pin","year":"1997","unstructured":"Pin, J.-E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 679\u2013746. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5_10"},{"issue":"4","key":"22_CR33","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/s00224-018-9867-0","volume":"63","author":"T Place","year":"2019","unstructured":"Place, T., Zeitoun, M.: Generic results for concatenation hierarchies. Theory Comput. Syst. 63(4), 849\u2013901 (2019). https:\/\/doi.org\/10.1007\/s00224-018-9867-0","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"22_CR34","first-page":"395","volume":"040","author":"L Pol\u00e1k","year":"2004","unstructured":"Pol\u00e1k, L.: A classification of rational languages by semilattice-ordered monoids. Archivum Mathematicum 040(4), 395\u2013406 (2004)","journal-title":"Archivum Mathematicum"},{"issue":"2","key":"22_CR35","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.S.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114\u2013125 (1959). https:\/\/doi.org\/10.1147\/rd.32.0114","journal-title":"IBM J. Res. Dev."},{"key":"22_CR36","unstructured":"Redko, V.N.: On the commutative closure of events. Doklady Akademija Nauk Ukrainskoj SSR (Kiev), also Dopovidi Akademij Nauk Ukrajnskoj RSR (= Reports of the Academy of Sciences of the Ukrainian SSR), pp. 1156\u20131159 (1963). (in Russian)"},{"issue":"3","key":"22_CR37","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/S0166-218X(03)00335-4","volume":"131","author":"M Rigo","year":"2003","unstructured":"Rigo, M.: The commutative closure of a binary slip-language is context-free: a new proof. Discret. Appl. Math. 131(3), 665\u2013672 (2003). https:\/\/doi.org\/10.1016\/S0166-218X(03)00335-4","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"22_CR38","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF02732984","volume":"36","author":"IK Rystsov","year":"2000","unstructured":"Rystsov, I.K.: Estimation of the length of reset words for automata with simple idempotents. Cybern. Syst. Anal. 36(3), 339\u2013344 (2000). https:\/\/doi.org\/10.1007\/BF02732984","journal-title":"Cybern. Syst. Anal."},{"key":"22_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/BFb0023848","volume-title":"LATIN \u201992","author":"J Sakarovitch","year":"1992","unstructured":"Sakarovitch, J.: The \u201clast\u2019\u2019 decision problem for rational trace languages. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 460\u2013473. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0023848"},{"key":"22_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume-title":"Automata Theory and Formal Languages","author":"I Simon","year":"1975","unstructured":"Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 214\u2013222. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/3-540-07407-4_23"},{"key":"22_CR41","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(81)90036-0","volume":"13","author":"H Straubing","year":"1981","unstructured":"Straubing, H.: A generalization of the Sch\u00fctzenberger product of finite monoids. Theoret. Comput. Sci. 13, 137\u2013150 (1981). https:\/\/doi.org\/10.1016\/0304-3975(81)90036-0","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR42","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0304-3975(81)90057-8","volume":"14","author":"D Th\u00e9rien","year":"1981","unstructured":"Th\u00e9rien, D.: Classification of finite monoids: the language approach. Theoret. Comput. Sci. 14, 195\u2013208 (1981). https:\/\/doi.org\/10.1016\/0304-3975(81)90057-8","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR43","doi-asserted-by":"crossref","unstructured":"Volkov, M.V., Kari, J.: \u010cern\u00fd\u2019s conjecture and the road colouring problem. In: Pin, J.\u00c9. (ed.) Handbook of Automata Theory, Volume I, pp. 525\u2013565. European Mathematical Society Publishing House (2021). https:\/\/doi.org\/10.4171\/automata-1\/15","DOI":"10.4171\/automata-1\/15"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2024: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52113-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:04:43Z","timestamp":1711569883000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cochem","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=90670&L=2","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":"81","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":"33","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":"41% - 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.11","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":"7","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)"}}]}}