{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T10:22:18Z","timestamp":1768213338381,"version":"3.49.0"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032156990","type":"print"},{"value":"9783032157003","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-15700-3_4","type":"book-chapter","created":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T07:21:59Z","timestamp":1768202519000},"page":"58-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Atomic Gliders and\u00a0Cellular Automata as\u00a0Language Generators"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6015-4170","authenticated-orcid":false,"given":"Dana","family":"Fisman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1333-2490","authenticated-orcid":false,"given":"Noa","family":"Izsak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,13]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10009-011-0216-8","volume":"14","author":"PA Abdulla","year":"2012","unstructured":"Abdulla, P.A.: Regular model checking. Int. J. Softw. Tools Technol. Transfer 14(2), 109\u2013118 (2012)","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-48683-6_14","volume-title":"Computer Aided Verification","author":"PA Abdulla","year":"1999","unstructured":"Abdulla, P.A., Bouajjani, A., Jonsson, B., Nilsson, M.: Handling global conditions in parametrized system verification. In: Halbwachs, N., Peled, D. (eds.) CAV 1999. LNCS, vol. 1633, pp. 134\u2013145. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48683-6_14"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-540-28644-8_3","volume-title":"CONCUR 2004 - Concurrency Theory","author":"PA Abdulla","year":"2004","unstructured":"Abdulla, P.A., Jonsson, B., Nilsson, M., Saksena, M.: A survey of regular model checking. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 35\u201348. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_3"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/978-3-319-10575-8_21","volume-title":"Handbook of Model Checking","author":"PA Abdulla","year":"2018","unstructured":"Abdulla, P.A., Sistla, A.P., Talupur, M.: Model checking parameterized systems. In: Handbook of Model Checking, pp. 685\u2013725. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_21"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of STOC, pp. 202\u2013211. Association for Computing Machinery (2004)","DOI":"10.1145\/1007352.1007390"},{"issue":"5","key":"4_CR6","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0167-8191(00)00076-4","volume":"27","author":"S Bandini","year":"2001","unstructured":"Bandini, S., Mauri, G., Serra, R.: Cellular automata: from a theoretical parallel computational model to its application to complex systems. Parallel Comput. 27(5), 539\u2013553 (2001)","journal-title":"Parallel Comput."},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/2951860.2951873","volume":"47","author":"R Bloem","year":"2016","unstructured":"Bloem, R., et al.: Decidability in parameterized verification. SIGACT News 47(2), 53\u201364 (2016)","journal-title":"SIGACT News"},{"issue":"3","key":"4_CR8","first-page":"237","volume":"14","author":"B Boigelot","year":"1999","unstructured":"Boigelot, B., Godefroid, P.: Symbolic verification of communication protocols with infinite state spaces using QDDs. FMCAD 14(3), 237\u2013255 (1999)","journal-title":"FMCAD"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/10722167_31","volume-title":"Computer Aided Verification","author":"A Bouajjani","year":"2000","unstructured":"Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 403\u2013418. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722167_31"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-27813-9_29","volume-title":"Computer Aided Verification","author":"A Bouajjani","year":"2004","unstructured":"Bouajjani, A., Habermehl, P., Vojnar, T.: Abstract regular model checking. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 372\u2013386. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27813-9_29"},{"key":"4_CR11","unstructured":"Byg, J., J\u00f8rgensen, K.Y.: Regular Model Checking and Verification of Cellular Automata. Master thesis, Aalborg University, Department of Computer Science (2008)"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-662-07675-0_10","volume-title":"Handbook of Formal Languages","author":"M-P B\u00e9al","year":"1997","unstructured":"B\u00e9al, M.-P., Perrin, D.: Symbolic dynamics and finite automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 463\u2013506. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-662-07675-0_10"},{"issue":"4","key":"4_CR13","first-page":"4","volume":"223","author":"J Conway","year":"1970","unstructured":"Conway, J.: The game of life. Sci. Am. 223(4), 4 (1970)","journal-title":"Sci. Am."},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.25088\/ComplexSystems.15.1.1","volume":"15","author":"M Cook","year":"2004","unstructured":"Cook, M.: Universality in elementary cellular automata. Complex Syst. 15(1), 1\u201340 (2004)","journal-title":"Complex Syst."},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/10721959_19","volume-title":"Automated Deduction - CADE-17","author":"EA Emerson","year":"2000","unstructured":"Emerson, E.A., Kahlon, V.: Reducing model checking of the many to the few. In: McAllester, D. (ed.) CADE 2000. LNCS (LNAI), vol. 1831, pp. 236\u2013254. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10721959_19"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Namjoshi, K.S.: Reasoning about rings. In: Proceedings of ACM SIGPLAN-SIGACT Symposium, pp. 85\u201394 (1995)","DOI":"10.1145\/199448.199468"},{"key":"4_CR17","unstructured":"Esparza, J., Raskin, M., Welzel-Mohr, C.: Regular model checking upside-down: an invariant-based approach. arXiv preprint arXiv:2205.03060 (2022)"},{"key":"4_CR18","unstructured":"Fisman, D., Izsak, N.: Atomic Gliders and CA as Language Generators (Extended Version) (2025). https:\/\/arxiv.org\/abs\/2511.12656"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Fisman, D., Izsak, N., Jacobs, S.: Learning broadcast protocols. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a011, pp. 12016\u201312023 (2024)","DOI":"10.1609\/aaai.v38i11.29089"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Fisman, D., Kupferman, O., Lustig, Y.: On verifying fault tolerance of distributed protocols. In: Proceedings of TACAS, pp. 315\u2013331 (2008)","DOI":"10.1007\/978-3-540-78800-3_22"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Fisman, D., Pnueli, A.: Beyond regular model checking. In: FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, 13\u201315 December 2001, Proceedings, pp. 156\u2013170 (2001)","DOI":"10.1007\/3-540-45294-X_14"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/S1571-0661(05)80427-X","volume":"9","author":"L Fribourg","year":"1997","unstructured":"Fribourg, L., Ols\u00e9n, H.: Reachability sets of parameterized rings as regular languages. Electron. Notes Theor. Comput. Sci. 9, 40 (1997)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"4_CR23","unstructured":"Gershenson, J.A.: Model Checking Omega Cellular Automata. Master\u2019s thesis, Carnegie Mellon University, School of Computer Science, Pittsburgh, PA (2010)"},{"key":"4_CR24","unstructured":"Guillon, P.: Automates cellulaires : dynamiques, simulations, traces. Ph.D. thesis, Universit\u00e9 Paris-Est (2008). https:\/\/theses.hal.science\/tel-00432058"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BF01691062","volume":"3","author":"GA Hedlund","year":"1969","unstructured":"Hedlund, G.A.: Endomorphisms and automorphisms of the shift dynamical system. Math. Syst. Theory 3, 320\u2013375 (1969)","journal-title":"Math. Syst. Theory"},{"issue":"3","key":"4_CR26","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1051\/ita\/1991250302551","volume":"25","author":"T Herbst","year":"1991","unstructured":"Herbst, T.: On a subclass of context-free groups. RAIRO-Theor. Inf. Appl. 25(3), 255\u2013272 (1991)","journal-title":"RAIRO-Theor. Inf. Appl."},{"issue":"1","key":"4_CR27","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/568438.568455","volume":"32","author":"JE Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation. ACM SIGACT News 32(1), 60\u201365 (2001)","journal-title":"ACM SIGACT News"},{"key":"4_CR28","unstructured":"Hurd, L.P.: Formal language characterization of cellular automaton limit sets. Complex Syst. 1 (1987)"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-030-53288-8_15","volume-title":"Computer Aided Verification","author":"N Jaber","year":"2020","unstructured":"Jaber, N., Jacobs, S., Wagner, C., Kulkarni, M., Samanta, R.: Parameterized verification of systems with global synchronization and guards. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12224, pp. 299\u2013323. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53288-8_15"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Jacobs, S., Bloem, R.: Parameterized synthesis. LMCS 10(1) (2014)","DOI":"10.2168\/LMCS-10(1:12)2014"},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/3-540-46419-0_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B Jonsson","year":"2000","unstructured":"Jonsson, B., Nilsson, M.: Transitive closures of regular relations for verifying infinite-state systems. In: Graf, S., Schwartzbach, M. (eds.) TACAS 2000. LNCS, vol. 1785, pp. 220\u2013235. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46419-0_16"},{"issue":"1","key":"4_CR32","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.11.021","volume":"334","author":"J Kari","year":"2005","unstructured":"Kari, J.: Theory of cellular automata: a survey. Theor. Comput. Sci. 334(1), 3\u201333 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/3-540-63166-6_41","volume-title":"Computer Aided Verification","author":"Y Resten","year":"1997","unstructured":"Resten, Y., Maler, O., Marcus, M., Pnueli, A., Shahar, E.: Symbolic model checking with rich assertional languages. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 424\u2013435. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63166-6_41"},{"key":"4_CR34","doi-asserted-by":"publisher","unstructured":"Khalimov, A., Jacobs, S., Bloem, R.: Towards efficient parameterized synthesis. In: VMCAI, pp. 108\u2013127. Springer, Heidelberg (2013). DOI: https:\/\/doi.org\/10.1007\/978-3-642-35873-9_9","DOI":"10.1007\/978-3-642-35873-9_9"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Kitchens, P.: One-sided, two-sided and countable state markov shifts. Symbolic Dynamics. Universitext, Springer (1998)","DOI":"10.1007\/978-3-642-58822-8"},{"issue":"2","key":"4_CR36","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1017\/S014338579706985X","volume":"17","author":"P Kurka","year":"1997","unstructured":"Kurka, P.: Languages, equicontinuity and attractors in cellular automata. Ergodic Theory Dynam. Syst. 17(2), 417\u2013433 (1997)","journal-title":"Ergodic Theory Dynam. Syst."},{"issue":"4","key":"4_CR37","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s002240000124","volume":"32","author":"P Kurka","year":"1999","unstructured":"Kurka, P.: Zero-dimensional dynamical systems, formal languages, and universality. Theory Comput. Syst. 32(4), 423\u2013433 (1999)","journal-title":"Theory Comput. Syst."},{"key":"4_CR38","unstructured":"Kurka, P.: Topological and symbolic dynamics. SMF France (2003)"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Kutrib, M.: Cellular Automata and Language Theory, pp. 513\u2013542. Springer, Heidelberg (2018)","DOI":"10.1007\/978-1-4939-8700-9_54"},{"issue":"2","key":"4_CR40","doi-asserted-by":"publisher","first-page":"111","DOI":"10.25088\/ComplexSystems.30.2.111","volume":"30","author":"M Kutrib","year":"2021","unstructured":"Kutrib, M., Malcher, A.: String generation by cellular automata. Complex Syst. 30(2), 111\u2013132 (2021)","journal-title":"Complex Syst."},{"issue":"3","key":"4_CR41","first-page":"223","volume":"15","author":"M Kutrib","year":"2020","unstructured":"Kutrib, M., Worsch, T.: Self-verifying cellular automata. J. Cell. Autom. 15(3), 223\u2013242 (2020)","journal-title":"J. Cell. Autom."},{"key":"4_CR42","unstructured":"Lazic, M., Konnov, I., Widder, J., Bloem, R.: Synthesis of distributed algorithms with parameterized threshold guards. In: OPODIS 2017, pp. 32\u20131 (2018)"},{"key":"4_CR43","unstructured":"Le\u00a0Lann, G.: Distributed systems-towards a formal approach. In: IFIP Congress, vol.\u00a07, pp. 155\u2013160 (1977)"},{"issue":"11","key":"4_CR44","doi-asserted-by":"publisher","first-page":"44","DOI":"10.4156\/jdcta.vol5.issue11.6","volume":"5","author":"G Lu","year":"2011","unstructured":"Lu, G., Wang, Y.: Research on model checking cellular automata. Int. J. Digital Content Technol. Appl. 5(11), 44\u201351 (2011)","journal-title":"Int. J. Digital Content Technol. Appl."},{"key":"4_CR45","doi-asserted-by":"crossref","unstructured":"Ma, H., Goel, A., Jeannin, J.B., Kapritsos, M., Kasikci, B., Sakallah, K.A.: I4: incremental inference of inductive invariants for verification of distributed protocols. In: SOSP, pp. 370\u2013384 (2019)","DOI":"10.1145\/3341301.3359651"},{"key":"4_CR46","doi-asserted-by":"crossref","unstructured":"Mathew, P., Penelle, V., Sreejith, A.: Learning deterministic one-counter automata in polynomial time. arXiv preprint arXiv:2503.04525 (2025)","DOI":"10.1109\/LICS65433.2025.00040"},{"key":"4_CR47","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. Ser. 6(78) (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"4_CR48","doi-asserted-by":"crossref","unstructured":"Neider, D., Jansen, N.: Regular model checking using solver technologies and automata learning. In: Proceedings of RWTH Aachen University (2013)","DOI":"10.1007\/978-3-642-38088-4_2"},{"issue":"1","key":"4_CR49","first-page":"3","volume":"5","author":"JV Neumann","year":"1966","unstructured":"Neumann, J.V.: Theory of self-reproducing automata. IEEE 5(1), 3\u201314 (1966)","journal-title":"IEEE"},{"key":"4_CR50","unstructured":"Nordahl, M.G.: Formal languages and finite cellular automata. Comput. Syst. (1989)"},{"key":"4_CR51","unstructured":"Roos, R.S.: Deciding equivalence of deterministic one-counter automata in polynomial time with applications to learning. The Pennsylvania State University (1988)"},{"key":"4_CR52","doi-asserted-by":"crossref","unstructured":"Smith, A.: Cellular automata and formal languages. In: FOCS, pp. 216\u2013224 (1970)","DOI":"10.1109\/SWAT.1970.4"},{"key":"4_CR53","unstructured":"Staquet, G.: Active Learning of Automata with Resources. Ph.D. thesis, University of Antwerp (2024)"},{"issue":"3","key":"4_CR54","first-page":"213","volume":"4","author":"K Sutner","year":"2009","unstructured":"Sutner, K.: Model checking one-dimensional cellular automata. J. Cell. Autom. 4(3), 213\u2013224 (2009)","journal-title":"J. Cell. Autom."},{"issue":"3","key":"4_CR55","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/S0022-0000(75)80005-5","volume":"10","author":"LG Valiant","year":"1975","unstructured":"Valiant, L.G., Paterson, M.S.: Deterministic one-counter automata. Computer Syst. Sci. 10(3), 340\u2013350 (1975)","journal-title":"Computer Syst. Sci."},{"issue":"3","key":"4_CR56","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1103\/RevModPhys.55.601","volume":"55","author":"S Wolfram","year":"1983","unstructured":"Wolfram, S.: Statistical mechanics of cellular automata. RMP 55(3), 601 (1983)","journal-title":"RMP"},{"issue":"1","key":"4_CR57","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01217347","volume":"96","author":"S Wolfram","year":"1984","unstructured":"Wolfram, S.: Computation theory of cellular automata. Commun. Math. Phys. 96(1), 15\u201357 (1984)","journal-title":"Commun. Math. Phys."},{"key":"4_CR58","unstructured":"Wolfram, S.: A New Kind of Science. Wolfram Media (2002)"},{"key":"4_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BFb0028736","volume-title":"Computer Aided Verification","author":"P Wolper","year":"1998","unstructured":"Wolper, P., Boigelot, B.: Verifying systems with infinite but regular state spaces. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol. 1427, pp. 88\u201397. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028736"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15700-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T07:22:04Z","timestamp":1768202524000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15700-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032156990","9783032157003"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15700-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 January 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 January 2026","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":"vmcai2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/VMCAI-2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}