{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T19:05:14Z","timestamp":1775070314010,"version":"3.50.1"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030934880","type":"print"},{"value":"9783030934897","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-93489-7_4","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:30:01Z","timestamp":1640997001000},"page":"38-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Sync-Maximal Permutation Groups Equal Primitive Permutation Groups"],"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":[[2022,1,1]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-02737-6_5","volume-title":"Developments in Language Theory","author":"J Almeida","year":"2009","unstructured":"Almeida, J., Steinberg, B.: Matrix mortality and the \u010cern\u00fd-Pin conjecture. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 67\u201380. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02737-6_5"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45007-6_8","volume-title":"Developments in Language Theory","author":"DS Ananichev","year":"2003","unstructured":"Ananichev, D.S., Volkov, M.V.: Synchronizing monotonic automata. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 111\u2013121. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45007-6_8"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.09.006","volume":"330","author":"DS Ananichev","year":"2005","unstructured":"Ananichev, D.S., Volkov, M.V.: Synchronizing generalized monotonic automata. Theor. Comput. Sci. 330(1), 3\u201313 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.jalgebra.2020.05.023","volume":"565","author":"J Ara\u00fajo","year":"2021","unstructured":"Ara\u00fajo, J., Bentz, W., Cameron, P.J.: Primitive permutation groups and strongly factorizable transformation semigroups. J. Algebra 565, 513\u2013530 (2021)","journal-title":"J. Algebra"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1090\/tran\/7274","volume":"371","author":"J Ara\u00fajo","year":"2019","unstructured":"Ara\u00fajo, J., Bentz, W., Cameron, P.J.: The existential transversal property: a generalization of homogeneity and its impact on semigroups. Trans. Am. Math. Soc. 371, 105\u2013136 (2019)","journal-title":"Trans. Am. Math. Soc."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.jctb.2014.01.006","volume":"106","author":"J Ara\u00fajo","year":"2014","unstructured":"Ara\u00fajo, J., Cameron, P.J.: Primitive groups synchronize non-uniform maps of extreme ranks. J. Comb. Theor. Ser. B 106, 98\u2013114 (2014)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.4171\/emss\/4-2-1","volume":"4","author":"J Ara\u00fajo","year":"2017","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)","journal-title":"EMS Surv. Math. Sci."},{"issue":"1\u20133","key":"4_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.tcs.2006.02.003","volume":"359","author":"F Arnold","year":"2006","unstructured":"Arnold, F., Steinberg, B.: Synchronizing groups and automata. Theor. Comput. Sci. 359(1\u20133), 101\u2013110 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.ins.2016.07.049","volume":"369","author":"MV Berlinkov","year":"2016","unstructured":"Berlinkov, M.V., Szykula, M.: Algebraic synchronization criterion and computing reset words. Inf. Sci. 369, 718\u2013730 (2016)","journal-title":"Inf. Sci."},{"key":"4_CR10","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":"4_CR11","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":"4_CR12","series-title":"London Mathematical Society Student Texts","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511623677","volume-title":"Permutation Groups","author":"PJ Cameron","year":"1999","unstructured":"Cameron, P.J.: Permutation Groups. London Mathematical Society Student Texts, Cambridge University Press, Cambridge (1999)"},{"issue":"3","key":"4_CR13","first-page":"208","volume":"14","author":"J \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J.: Pozn\u00e1mka k homog\u00e9nnym experimentom s kone\u010dn\u00fdmi automatmi. Matematicko-fyzik\u00e1lny \u010dasopis 14(3), 208\u2013216 (1964)","journal-title":"Matematicko-fyzik\u00e1lny \u010dasopis"},{"key":"4_CR14","first-page":"289","volume":"7","author":"J \u010cern\u00fd","year":"1971","unstructured":"\u010cern\u00fd, J., Pirick\u00e1, A., Rosenauerova, B.: On directable automata. Kybernetica 7, 289\u2013298 (1971)","journal-title":"Kybernetica"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Don, H.: The \u010dern\u00fd conjecture and 1-contracting automata. Electron. J. Comb. 23(3), P3.12 (2016)","DOI":"10.37236\/5616"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1051\/ita\/1996300604951","volume":"30","author":"L Dubuc","year":"1996","unstructured":"Dubuc, L.: Les automates circulaires biais\u00e9s verifient la conjecture de \u010cern\u00fd. Inform. Theor. Appl. 30, 495\u2013505 (1996)","journal-title":"Inform. Theor. Appl."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1051\/ita\/1998321-300211","volume":"32","author":"L Dubuc","year":"1998","unstructured":"Dubuc, L.: Les automates circulaires et la conjecture de \u010cern\u00fd. Inform. Theor. Appl. 32, 21\u201334 (1998)","journal-title":"Inform. Theor. Appl."},{"issue":"3","key":"4_CR18","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)","journal-title":"SIAM J. Comput."},{"key":"4_CR19","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.) MFCS 2019. LIPIcs, vol. 138, pp. 63:1\u201363:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"issue":"2\u20134","key":"4_CR20","first-page":"287","volume":"24","author":"H Fernau","year":"2019","unstructured":"Fernau, H., Hoffmann, S.: Extensions to minimal synchronizing words. J. Autom. Lang. Comb. 24(2\u20134), 287\u2013307 (2019)","journal-title":"J. Autom. Lang. Comb."},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0195-6698(82)80025-5","volume":"3","author":"P Frankl","year":"1982","unstructured":"Frankl, P.: An extremal problem for two families of sets. Eur. J. Comb. 3, 125\u2013127 (1982)","journal-title":"Eur. J. Comb."},{"key":"4_CR22","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":"4_CR23","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2021.08.030","volume":"890","author":"S Hoffmann","year":"2021","unstructured":"Hoffmann, S.: Constrained synchronization and commutative languages. Theor. Comput. Sci. 890, 147\u2013170 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.08.030","journal-title":"Theor. Comput. Sci."},{"key":"4_CR24","unstructured":"Hoffmann, S.: Constrained synchronization for commutative automata and automata with simple idempotents. CoRR (2021). https:\/\/arxiv.org\/abs\/2109.02743"},{"key":"4_CR25","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":"4_CR26","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)"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-44683-4_38","volume-title":"Mathematical Foundations of Computer Science 2001","author":"J Kari","year":"2001","unstructured":"Kari, J.: Synchronizing finite automata on Eulerian digraphs. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 432\u2013438. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44683-4_38"},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/sapm1970491101","volume":"49","author":"D Kfoury","year":"1970","unstructured":"Kfoury, D.: Synchronizing sequences for probabilistic automata. Stud. Appl. Math. 49, 101\u2013103 (1970)","journal-title":"Stud. Appl. Math."},{"key":"4_CR29","volume-title":"Switching and Finite Automata Theory","author":"Z Kohavi","year":"1970","unstructured":"Kohavi, Z.: Switching and Finite Automata Theory. McGraw Hill, New-York (1970)"},{"issue":"2","key":"4_CR30","first-page":"517","volume":"19","author":"P Martyugin","year":"2009","unstructured":"Martyugin, P.: Complexity of problems concerning reset words for some partial cases of automata. Acta Cybern. 19(2), 517\u2013536 (2009)","journal-title":"Acta Cybern."},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-31606-7_24","volume-title":"Implementation and Application of Automata","author":"PV Martyugin","year":"2012","unstructured":"Martyugin, P.V.: Synchronization of automata with one undefined or ambiguous transition. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol. 7381, pp. 278\u2013288. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31606-7_24"},{"key":"4_CR32","unstructured":"Maslennikova, M.I.: Reset complexity of ideal languages. CoRR abs\/1404.2816 (2014)"},{"issue":"6\u20137","key":"4_CR33","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)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"4_CR34","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1307\/mmj\/1242071695","volume":"58","author":"PM Neumann","year":"2009","unstructured":"Neumann, P.M.: Primitive permutation groups and their section-regular partitions. Michigan Math. J. 58, 309\u2013322 (2009)","journal-title":"Michigan Math. J."},{"key":"4_CR35","unstructured":"Pin, J.E.: Sur la longueur des mots de rang donn\u00e9 d\u2019un automate fini. C. R. Acad. Sci. Paris S\u00e9r. A-B 284, 1233\u20131235 (1977)"},{"key":"4_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-08860-1_25","volume-title":"Automata, Languages and Programming","author":"JE Pin","year":"1978","unstructured":"Pin, J.E.: Sur un cas particulier de la conjecture de Cerny. In: Ausiello, G., B\u00f6hm, C. (eds.) ICALP 1978. LNCS, vol. 62, pp. 345\u2013352. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/3-540-08860-1_25"},{"key":"4_CR37","unstructured":"Pin, J.E.: Le probl\u00e8me de la synchronisation et la conjecture de \u010dern\u00fd. In: De luca, A. (ed.) Non-commutative Structures in Algebra and Geometric Combinatorics, Quaderni de la Ricerca Scientifica, vol. 109, pp. 37\u201348. CNR, Roma (1981)"},{"key":"4_CR38","first-page":"535","volume":"17","author":"JE Pin","year":"1983","unstructured":"Pin, J.E.: On two combinatorial problems arising from automata theory. Ann. Discrete Math. 17, 535\u2013548 (1983)","journal-title":"Ann. Discrete Math."},{"issue":"3\u20134","key":"4_CR39","first-page":"405","volume":"48","author":"IK Rystsov","year":"1996","unstructured":"Rystsov, I.K.: Exact linear bound for the length of reset words in commutative automata. Publicationes Mathematicae Debrecen 48(3\u20134), 405\u2013409 (1996)","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"4_CR40","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0304-3975(96)00136-3","volume":"172","author":"IK Rystsov","year":"1997","unstructured":"Rystsov, I.K.: Reset words for commutative and solvable automata. Theor. Comput. Sci. 172, 273\u2013279 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"4_CR41","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)","journal-title":"Cybern. Syst. Anal."},{"key":"4_CR42","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 Academy Science (1980). (in Russian)"},{"key":"4_CR43","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.: 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"},{"issue":"2\u20134","key":"4_CR44","first-page":"367","volume":"24","author":"Y Shitov","year":"2019","unstructured":"Shitov, Y.: An improvement to a recent upper bound for synchronizing words of finite automata. J. Automata Lang. Comb. 24(2\u20134), 367\u2013373 (2019)","journal-title":"J. Automata Lang. Comb."},{"key":"4_CR45","first-page":"61","volume":"2","author":"PH Starke","year":"1966","unstructured":"Starke, P.H.: Eine Bemerkung \u00fcber homogene Experimente. Elektronische Informationverarbeitung und Kybernetik (later J. Inf. Process. Cybern.) 2, 61\u201382 (1966)","journal-title":"Elektronische Informationverarbeitung und Kybernetik (later J. Inf. Process. Cybern.)"},{"issue":"39","key":"4_CR46","doi-asserted-by":"publisher","first-page":"5487","DOI":"10.1016\/j.tcs.2011.06.012","volume":"412","author":"B Steinberg","year":"2011","unstructured":"Steinberg, B.: The \u010cern\u00fd conjecture for one-cluster automata with prime length cycle. Theor. Comput. Sci. 412(39), 5487\u20135491 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR47","unstructured":"Szykula, M.: Improving the upper bound on the length of the shortest reset word. In: Niedermeier, R., Vall\u00e9e, B. (eds.) STACS 2018. LIPIcs, vol. 96, pp. 56:1\u201356:13. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018)"},{"issue":"2","key":"4_CR48","first-page":"3","volume":"9","author":"AN Trahtman","year":"2007","unstructured":"Trahtman, A.N.: The \u010cern\u00fd conjecture for aperiodic automata. Discrete Math. Theor. Comput. Sci. 9(2), 3\u201310 (2007)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"4_CR49","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"},{"issue":"37","key":"4_CR50","doi-asserted-by":"publisher","first-page":"3513","DOI":"10.1016\/j.tcs.2009.03.021","volume":"410","author":"MV Volkov","year":"2009","unstructured":"Volkov, M.V.: Synchronizing automata preserving a chain of partial orders. Theor. Comput. Sci. 410(37), 3513\u20133519 (2009)","journal-title":"Theor. 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-030-93489-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:03:41Z","timestamp":1767229421000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93489-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030934880","9783030934897"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93489-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/toc.yonsei.ac.kr\/dcfs2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}