{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:45:11Z","timestamp":1778496311227,"version":"3.51.4"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031332630","type":"print"},{"value":"9783031332647","type":"electronic"}],"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_11","type":"book-chapter","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:03:26Z","timestamp":1684397006000},"page":"128-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Completely Distinguishable Automata and\u00a0the\u00a0Set of\u00a0Synchronizing Words"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7866-075X","authenticated-orcid":false,"given":"Stefan","family":"Hoffmann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,19]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Ara\u00fajo, J., Cameron, P.J., Steinberg, B.: Between primitive and 2-transitive: synchronization and its friends. EMS Surv. Math. Sci. 4(2), 101\u2013184 (2017). http:\/\/www.ems-ph.org\/doi\/10.4171\/EMSS","DOI":"10.4171\/EMSS\/4-2-1"},{"key":"11_CR2","first-page":"1447","volume-title":"Automorphism Groups, Isomorphism","author":"L Babai","year":"1996","unstructured":"Babai, L.: Automorphism Groups, Isomorphism, pp. 1447\u20131540. Reconstruction. MIT Press, Cambridge, MA, USA (1996)"},{"key":"11_CR3","volume-title":"Codes and Automata, Encyclopedia of mathematics and its applications","author":"J Berstel","year":"2010","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata, Encyclopedia of mathematics and its applications, vol. 129. Cambridge University Press, Cambridge (2010)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-41114-9_1","volume-title":"Descriptional Complexity of Formal Systems","author":"EA Bondar","year":"2016","unstructured":"Bondar, E.A., Volkov, M.V.: Completely reachable automata. In: C\u00e2mpeanu, C., Manea, F., Shallit, J. (eds.) DCFS 2016. LNCS, vol. 9777, pp. 1\u201317. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41114-9_1"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-319-98654-8_12","volume-title":"Developments in Language Theory","author":"EA Bondar","year":"2018","unstructured":"Bondar, E.A., Volkov, M.V.: A characterization of completely reachable automata. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 145\u2013155. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98654-8_12"},{"key":"11_CR6","unstructured":"Bondar, E.A., David, Volkov, M.V.: Completely reachable automata: an interplay between automata, graphs, and trees. CoRR abs\/2201.05075 (2022). https:\/\/arxiv.org\/abs\/2201.05075. (accepted for publication in Int. J. Found. Comput. Sci.)"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10801-016-0703-9","volume":"45","author":"PJ Cameron","year":"2016","unstructured":"Cameron, P.J., Castillo-Ramirez, A., Gadouleau, M., Mitchell, J.D.: Lengths of words in transformation semigroups generated by digraphs. J. Algebraic Combin. 45(1), 149\u2013170 (2016). https:\/\/doi.org\/10.1007\/s10801-016-0703-9","journal-title":"J. Algebraic Combin."},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Casas, D., Volkov, M.V.: Binary completely reachable automata. In: Casta\u00f1eda, A., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LATIN 2022: Theoretical Informatics - 15th Latin American Symposium, Guanajuato, Mexico, 7\u201311 November 2022, Proceedings. Lecture Notes in Computer Science, vol. 13568, pp. 345\u2013358. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-20624-5_21","DOI":"10.1007\/978-3-031-20624-5_21"},{"key":"11_CR9","unstructured":"\u010cern\u00fd, J.: Pozn\u00e1mka k homog\u00e9nnym experimentom s kone\u010dn\u00fdmi automatmi. Matematicko-fyzik\u00e1lny \u010dasopis 14(3), 208\u2013216 (1964). (Translation: A Note on Homogeneous Experiments with Finite Automata. Journal of Automata, Languages and Combinatorics 24 (2019) 2\u20134, 123\u2013132)"},{"key":"11_CR10","unstructured":"Cern\u00fd, J., Pirick\u00e1, A., Rosenauerov\u00e1, B.: On directable automata. Kybernetika 7(4), 289\u2013298 (1971). http:\/\/www.kybernetika.cz\/content\/1971\/4\/289"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/0219033","volume":"19","author":"D Eppstein","year":"1990","unstructured":"Eppstein, D.: Reset sequences for monotonic automata. SIAM J. Comput. 19(3), 500\u2013510 (1990). https:\/\/doi.org\/10.1137\/0219033","journal-title":"SIAM J. Comput."},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Ferens, R., Szyku\u0142a, M.: Completely reachable automata: A polynomial solution and quadratic bounds for the subset reachability problem. CoRR abs\/2208.05956 (2022). 10.48550\/arXiv. 2208.05956, https:\/\/doi.org\/10.48550\/arXiv.2208.05956","DOI":"10.48550\/arXiv.2208.05956"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Fernau, H., Gusev, V.V., Hoffmann, S., Holzer, M., Volkov, M.V., Wolf, P.: Computational complexity of synchronization under regular constraints. In: Rossmanith, P., Heggernes, P., Katoen, J. (eds.) 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, 26\u201330 August 2019, Aachen, Germany. LIPIcs, vol. 138, pp. 1\u201314. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2019.63","DOI":"10.4230\/LIPIcs.MFCS.2019.63"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Gao, Y., Moreira, N., Reis, R., Yu, S.: A survey on operational state complexity. J. Automata, Lang. Comb. 21(4), 251\u2013310 (2017). https:\/\/doi.org\/10.25596\/jalc-2016-251","DOI":"10.25596\/jalc-2016-251"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-662-48057-1_19","volume-title":"Mathematical Foundations of Computer Science 2015","author":"P Gawrychowski","year":"2015","unstructured":"Gawrychowski, P., Straszak, D.: Strong inapproximability of the shortest reset word. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 243\u2013255. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48057-1_19"},{"issue":"2\u20134","key":"11_CR16","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BF01891840","volume":"10","author":"KY Goldberg","year":"1993","unstructured":"Goldberg, K.Y.: Orienting polygonal parts without sensors. Algorithmica 10(2\u20134), 210\u2013225 (1993). https:\/\/doi.org\/10.1007\/BF01891840","journal-title":"Algorithmica"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Gonze, F., Jungers, R.M.: Hardly reachable subsets and completely reachable automata with 1-deficient words. J. Automata, Lang. Comb. 24(2\u20134), 321\u2013342 (2019). https:\/\/doi.org\/10.25596\/jalc-2019-321","DOI":"10.25596\/jalc-2019-321"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Hamidoune, Y.O.: Quelques probl\u00e8mes de connexit\u00e9 dans les graphes orient\u00e9s. J. Comb. Theory, Ser. B 30(1), 1\u201310 (1981). https:\/\/doi.org\/10.1016\/0095-8956(81)90085-X","DOI":"10.1016\/0095-8956(81)90085-X"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-030-68195-1_24","volume-title":"Language and Automata Theory and Applications","author":"S Hoffmann","year":"2021","unstructured":"Hoffmann, S.: Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words. In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2021. LNCS, vol. 12638, pp. 305\u2013317. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68195-1_24"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Hoffmann, S.: Constrained synchronization and commutativity. Theor. Comput. Sci. 890, 147\u2013170 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.08.030","DOI":"10.1016\/j.tcs.2021.08.030"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-030-68195-1_25","volume-title":"Language and Automata Theory and Applications","author":"S Hoffmann","year":"2021","unstructured":"Hoffmann, S.: State complexity of the set of synchronizing words for circular automata and automata over binary alphabets. In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2021. LNCS, vol. 12638, pp. 318\u2013330. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68195-1_25"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Hoffmann, S.: Sync-maximal permutation groups equal primitive permutation groups. In: Han, Y., Ko, S. (eds.) Descriptional Complexity of Formal Systems - 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, 5 September 2021, Proceedings. Lecture Notes in Computer Science, vol. 13037, pp. 38\u201350. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-93489-7_4","DOI":"10.1007\/978-3-030-93489-7_4"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Hoffmann, S.: Reset complexity and completely reachable automata with simple idempotents. In: Han, Y., Vaszil, G. (eds.) Descriptional Complexity of Formal Systems - 24rd IFIP WG 1.02 International Conference, DCFS 2022, 29\u201331 August 2022, Debrecen, Hungary, Proceedings. Lecture Notes in Computer Science, vol. 13439, pp. 85\u201399. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-13257-5_7","DOI":"10.1007\/978-3-031-13257-5_7"},{"issue":"2","key":"11_CR24","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.ic.2017.09.003","volume":"259","author":"M Holzer","year":"2018","unstructured":"Holzer, M., Jakobi, S.: On the computational complexity of problems related to distinguishability sets. Inf. Comput. 259(2), 225\u2013236 (2018). https:\/\/doi.org\/10.1016\/j.ic.2017.09.003","journal-title":"Inf. Comput."},{"key":"11_CR25","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, Boston (1979)"},{"issue":"1","key":"11_CR26","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","volume":"11","author":"ND Jones","year":"1975","unstructured":"Jones, N.D.: Space-bounded reducibility among combinatorial problems. J. Comput. Syst. Sci. 11(1), 68\u201385 (1975). https:\/\/doi.org\/10.1016\/S0022-0000(75)80050-X","journal-title":"J. Comput. Syst. Sci."},{"issue":"9\u201310","key":"11_CR27","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1016\/j.ic.2008.03.005","volume":"206","author":"H J\u00fcrgensen","year":"2008","unstructured":"J\u00fcrgensen, H.: Synchronization. Inf. Comput. 206(9\u201310), 1033\u20131044 (2008). https:\/\/doi.org\/10.1016\/j.ic.2008.03.005","journal-title":"Inf. Comput."},{"issue":"6\u20137","key":"11_CR28","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1142\/S0129054119400343","volume":"30","author":"MI Maslennikova","year":"2019","unstructured":"Maslennikova, M.I.: Reset complexity of ideal languages over a binary alphabet. Int. J. Found. Comput. Sci. 30(6\u20137), 1177\u20131196 (2019). https:\/\/doi.org\/10.1142\/S0129054119400343","journal-title":"Int. J. Found. Comput. Sci."},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Natarajan, B.K.: An algorithmic approach to the automated design of parts Orienters. In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27\u201329 October 1986. pp. 132\u2013142. IEEE Computer Society (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.5","DOI":"10.1109\/SFCS.1986.5"},{"key":"11_CR30","doi-asserted-by":"publisher","unstructured":"Neumann, P.M.: The Mathematical Writings of \u00c9variste Galois. European Mathematical Society, Helsinki, Heritage of European Mathematics (2011). https:\/\/doi.org\/10.4171\/104","DOI":"10.4171\/104"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-642-15155-2_50","volume-title":"Mathematical Foundations of Computer Science 2010","author":"J Olschewski","year":"2010","unstructured":"Olschewski, J., Ummels, M.: The complexity of finding reset words in finite automata. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 568\u2013579. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15155-2_50"},{"key":"11_CR32","unstructured":"Rystsov, I.K.: On minimizing the length of synchronizing words for finite automata. In: Theory of Designing of Computing Systems, pp. 75\u201382. Institute of Cybernetics of Ukrainian Acad. Sci. (1980). (in Russian)"},{"issue":"3","key":"11_CR33","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":"11_CR34","doi-asserted-by":"publisher","unstructured":"Rystsov, I.K.: Cerny\u2019s conjecture for automata with simple idempotents. Cybern. Syst. Anal. 58(1), 1\u20137 (2022). https:\/\/doi.org\/10.1007\/s10559-022-00428-3","DOI":"10.1007\/s10559-022-00428-3"},{"key":"11_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/11498490_2","volume-title":"Model-Based Testing of Reactive Systems","author":"S Sandberg","year":"2005","unstructured":"Sandberg, S.: 1 homing and synchronizing sequences. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol. 3472, pp. 5\u201333. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11498490_2"},{"key":"11_CR36","unstructured":"Starke, P.H.: Eine Bemerkung \u00fcber homogene Experimente. Elektronische Informationverarbeitung und Kybernetik (later Journal of Information Processing and Cybernetics) 2(2), 61\u201382 (1966), (Translation: A remark about homogeneous experiments. Journal of Automata, Languages and Combinatorics 24 (2019) 2\u20134, 133\u2013237)"},{"issue":"1","key":"11_CR37","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s11856-009-0062-5","volume":"172","author":"AN Trahtman","year":"2009","unstructured":"Trahtman, A.N.: The road coloring problem. Israel J. Math. 172(1), 51\u201360 (2009). https:\/\/doi.org\/10.1007\/s11856-009-0062-5","journal-title":"Israel J. Math."},{"key":"11_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-88282-4_4","volume-title":"Language and Automata Theory and Applications","author":"MV Volkov","year":"2008","unstructured":"Volkov, M.V.: Synchronizing automata and the \u010cern\u00fd conjecture. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 11\u201327. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88282-4_4"},{"key":"11_CR39","doi-asserted-by":"publisher","unstructured":"Volkov, M.V.: Preface. J. Automata, Lang. Comb. 24(2\u20134), 119\u2013121 (2019). https:\/\/doi.org\/10.25596\/jalc-2019-119","DOI":"10.25596\/jalc-2019-119"},{"key":"11_CR40","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)","DOI":"10.4171\/Automata-1\/15"},{"key":"11_CR41","doi-asserted-by":"publisher","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","DOI":"10.1016\/0304-3975(92)00011-F"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:05:08Z","timestamp":1684397108000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33264-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332630","9783031332647"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33264-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}