{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:57:54Z","timestamp":1782867474659,"version":"3.54.5"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032227485","type":"print"},{"value":"9783032227492","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-22749-2_20","type":"book-chapter","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T13:11:30Z","timestamp":1776258690000},"page":"394-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Deconstructing Subset Construction"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-4060-7307","authenticated-orcid":false,"given":"John","family":"Nicol","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6520-2410","authenticated-orcid":false,"given":"Markus","family":"Frohme","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,15]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Parosh Aziz Abdulla et al. \u201cWhen Simulation Meets Antichains\u201d. In: Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20\u201328, 2010. Proceedings. Ed. by Javier Esparza and Rupak Majumdar. Vol. 6015. Lecture Notes in Computer Science. Springer, 2010, pp. 158\u2013174. https:\/\/doi.org\/10.1007\/978-3-642-12002-2_14.","DOI":"10.1007\/978-3-642-12002-2_14"},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"Alfred V. Aho and Margaret J. Corasick. \u201cEfficient String Matching: An Aid to Bibliographic Search\u201d. In: Commun. ACM 18.6 (1975), pp. 333\u2013340. https:\/\/doi.org\/10.1145\/360825.360855.","DOI":"10.1145\/360825.360855"},{"key":"20_CR3","unstructured":"AutomataLib GitHub page. Online. Accessed: Jan 12, 2026. URL: https:\/\/github.com\/LearnLib\/automatalib."},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Jason P. Bell, Thomas F. Lidbetter, and Jeffrey O. Shallit. \u201cAdditive Number Theory via Approximation by Regular Languages\u201d. In: Int. J. Found. Comput. Sci. 31.6 (2020), pp. 667\u2013687. https:\/\/doi.org\/10.1142\/S0129054120410014.","DOI":"10.1142\/S0129054120410014"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Karell Bertet et al. \u201cLattices, closures systems and implication bases: A survey of structural aspects and algorithms\u201d. In: Theor. Comput. Sci. 743 (2018), pp. 93\u2013109. https:\/\/doi.org\/10.1016\/J.TCS.2016.11.021.","DOI":"10.1016\/J.TCS.2016.11.021"},{"key":"20_CR6","doi-asserted-by":"publisher","unstructured":"Filippo Bonchi and Damien Pous. \u201cChecking NFA equivalence with bisimulations up to congruence\u201d. In: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL \u201913, Rome, Italy - January 23\u201325, 2013. Ed. by Roberto Giacobazzi and Radhia Cousot. ACM, 2013, pp. 457\u2013468. https:\/\/doi.org\/10.1145\/2429069.2429124.","DOI":"10.1145\/2429069.2429124"},{"key":"20_CR7","unstructured":"Wieb Bosma et al. \u201cUsing Walnut to solve problems from the OEIS\u201d. In: J. Integer Seq. 28.1 (2025), p. 25.3.8. URL: https:\/\/cs.uwaterloo.ca\/journals\/JIS\/VOL28\/Fokkink\/fokkink9.html."},{"key":"20_CR8","doi-asserted-by":"publisher","unstructured":"Manfred Broy et al. Model-Based Testing of Reactive Systems. Vol. 3472. Lecture Notes in Computer Science. Secaucus, NJ, USA: Springer-Verlag, New York Inc, 2005. https:\/\/doi.org\/10.1007\/b137241.","DOI":"10.1007\/b137241"},{"key":"20_CR9","unstructured":"Janusz A. Brzozowski. \u201cCanonical regular expressions and minimal state graphs for definite events\u201d. In: Proc. Symposium of Mathematical Theory of Automata. 1962, pp. 529\u2013561."},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Micha\u00ebl Cadilhac et al. \u201cData Structures for Finite Downsets of Natural Vectors: Theory and Practice\u201d. In: Automated Technology for Verification and Analysis - 23rd International Symposium, ATVA 2025, Bengaluru, India, October 27\u201331, 2025, Proceedings. Ed. by Meenakshi D\u2019Souza, Raghavan Komondoor, and B. Srivathsan. Vol. 16145. Lecture Notes in Computer Science. Springer, 2025, pp. 425\u2013446. https:\/\/doi.org\/10.1007\/978-3-032-08707-2_20.","DOI":"10.1007\/978-3-032-08707-2_20"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"David Chocholat\u00fd et al. \u201cMata: A Fast and Simple Finite Automata Library\u201d. In: Tools and Algorithms for the Construction and Analysis of Systems - 30th International Conference, TACAS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6\u201311, 2024, Proceedings, Part II. Ed. by Bernd Finkbeiner and Laura Kov\u00e1cs. Vol. 14571. Lecture Notes in Computer Science. Springer, 2024, pp. 130\u2013151. https:\/\/doi.org\/10.1007\/978-3-031-57249-4_7.","DOI":"10.1007\/978-3-031-57249-4_7"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Lorenzo Clemente and Richard Mayr. \u201cEfficient reduction of nondeterministic automata with application to language inclusion testing\u201d. In: Log. Methods Comput. Sci. 15.1 (2019). DOI: https:\/\/doi.org\/10.23638\/LMCS-15(1:12)2019","DOI":"10.23638\/LMCS-15(1:12)2019"},{"key":"20_CR13","doi-asserted-by":"publisher","unstructured":"James D. Currie et al. \u201cProperties of a ternary infinite word\u201d. In: RAIRO Theor. Informatics Appl. 57 (2023), p. 1. https:\/\/doi.org\/10.1051\/ITA\/2022010.","DOI":"10.1051\/ITA\/2022010"},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Laurent Doyen and Jean-Fran\u00e7ois Raskin. \u201cAntichain Algorithms for Finite Automata\u201d. In: Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, TACAS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20\u201328, 2010. Proceedings. Ed. by Javier Esparza and Rupak Majumdar. Vol. 6015. Lecture Notes in Computer Science. Springer, 2010, pp. 2\u201322. https:\/\/doi.org\/10.1007\/978-3-642-12002-2_2.","DOI":"10.1007\/978-3-642-12002-2_2"},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"Gabriele Fici and Jeffrey O. Shallit. \u201cProperties of a class of Toeplitz words\u201d. In: Theor. Comput. Sci. 922 (2022), pp. 1\u201312. https:\/\/doi.org\/10.1016\/J.TCS.2022.04.006.","DOI":"10.1016\/J.TCS.2022.04.006"},{"key":"20_CR16","doi-asserted-by":"publisher","unstructured":"Chen Fu et al. \u201cOn Equivalence Checking of Nondeterministic Finite Automata\u201d. In: Dependable Software Engineering. Theories, Tools, and Applications - Third International Symposium, SETTA 2017, Changsha, China, October 23\u201325, 2017, Proceedings. Ed. by Kim Guldstrand Larsen, Oleg Sokolsky, and Ji Wang. Vol. 10606. Lecture Notes in Computer Science. Springer, 2017, pp. 216\u2013231. https:\/\/doi.org\/10.1007\/978-3-319-69483-2_13.","DOI":"10.1007\/978-3-319-69483-2_13"},{"key":"20_CR17","doi-asserted-by":"publisher","unstructured":"Daniel Gabric and Jeffrey O. Shallit. \u201cThe simplest binary word with only three squares\u201d. In: RAIRO Theor. Informatics Appl. 55 (2021), pp. 1\u20137. https:\/\/doi.org\/10.1051\/ITA\/2021001.","DOI":"10.1051\/ITA\/2021001"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Hubert Garavel and Fr\u00e9d\u00e9ric Lang. \u201cEquivalence Checking 40 Years After: A Review of Bisimulation Tools\u201d. In: Lecture Notes in Computer Science 13560 (2022). Ed. by Nils Jansen, Mari\u00eblle Stoelinga, and Petra van den Bos, pp. 213\u2013265. https:\/\/doi.org\/10.1007\/978-3-031-15629-8_13.","DOI":"10.1007\/978-3-031-15629-8_13"},{"key":"20_CR19","doi-asserted-by":"publisher","unstructured":"Rob J. van Glabbeek. \u201cThe Linear Time-Branching Time Spectrum (Extended Abstract)\u201d. In: CONCUR \u201990, Theories of Concurrency: Unification and Extension, Amsterdam, The Netherlands, August 27\u201330, 1990, Proceedings. Ed. by Jos C. M. Baeten and Jan Willem Klop. Vol. 458. Lecture Notes in Computer Science. Springer, 1990, pp. 278\u2013297. https:\/\/doi.org\/10.1007\/BFB0039066.","DOI":"10.1007\/BFB0039066"},{"key":"20_CR20","doi-asserted-by":"publisher","unstructured":"Rob J. van Glabbeek and Bas Ploeger. \u201cFive Determination Algorithms\u201d. In: Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21\u201324, 2008. Proceedings. Ed. by Oscar H. Ibarra and Bala Ravikumar. Vol. 5148. Lecture Notes in Computer Science. Springer, 2008, pp. 161\u2013170. https:\/\/doi.org\/10.1007\/978-3-540-70844-5_17.","DOI":"10.1007\/978-3-540-70844-5_17"},{"key":"20_CR21","doi-asserted-by":"publisher","unstructured":"Markus Holzer and Martin Kutrib. \u201cDescriptional and computational complexity of finite automata - A survey\u201d. In: Inf. Comput. 209.3 (2011), pp. 456\u2013470. https:\/\/doi.org\/10.1016\/J.IC.2010.11.013.","DOI":"10.1016\/J.IC.2010.11.013"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"John Hopcroft. \u201cAn $$n \\log n$$ algorithm for minimizing states in a finite automaton\u201d. In: Theory of machines and computations. Elsevier, 1971, pp. 189\u2013196.","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"20_CR23","unstructured":"John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to automata theory, languages, and computation, 3rd Edition. 2007."},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"David Lee and Mihalis Yannakakis. \u201cPrinciples and Methods of Testing Finite State Machines - a Survey\u201d. In: Proc. IEEE 84.8 (1996), pp. 1090\u20131123. https:\/\/doi.org\/10.1109\/5.533956.","DOI":"10.1109\/5.533956"},{"key":"20_CR25","unstructured":"Yongming Luo. \u201cDesigning algorithms for big graph datasets : a study of computing bisimulation and joins\u201d. PhD thesis. Technische Universiteit Eindhoven, Netherlands, 2015. ISBN: 978-90-386-3801-0."},{"key":"20_CR26","doi-asserted-by":"publisher","unstructured":"Joseph Meleshko et al. \u201cPseudoperiodic Words and a Question of Shevelev\u201d. In: Discret. Math. Theor. Comput. Sci. 25.2 (2023). https:\/\/doi.org\/10.46298\/DMTCS.9919.","DOI":"10.46298\/DMTCS.9919"},{"key":"20_CR27","unstructured":"Bastien Mignoty et al. \u201cAutomatic proofs in combinatorial game theory\u201d. 2024. URL: https:\/\/hdl.handle.net\/2268\/323845."},{"key":"20_CR28","unstructured":"Robin Milner. Communication and concurrency. PHI Series in computer science. Prentice Hall, 1989. ISBN: 978-0-13-115007-2."},{"key":"20_CR29","doi-asserted-by":"publisher","unstructured":"Hamoon Mousavi and Jeffrey O. Shallit. \u201cMechanical Proofs of Properties of the Tribonacci Word\u201d. In: Combinatorics on Words - 10th International Conference, WORDS 2015, Kiel, Germany, September 14\u201317, 2015, Proceedings. Ed. by Florin Manea and Dirk Nowotka. Vol. 9304. Lecture Notes in Computer Science. Springer, 2015, pp. 170\u2013190. https:\/\/doi.org\/10.1007\/978-3-319-23660-5_15.","DOI":"10.1007\/978-3-319-23660-5_15"},{"key":"20_CR30","unstructured":"OTF GitHub page. Online. Accessed: Jan 12, 2026. URL: https:\/\/github.com\/jniz\/OTF."},{"key":"20_CR31","doi-asserted-by":"publisher","unstructured":"Michael O. Rabin and Dana S. Scott. \u201cFinite Automata and Their Decision Problems\u201d. In: IBM J. Res. Dev. 3.2 (1959), pp. 114\u2013125. https:\/\/doi.org\/10.1147\/RD.32.0114.","DOI":"10.1147\/RD.32.0114"},{"key":"20_CR32","doi-asserted-by":"publisher","unstructured":"Francesco Ranzato and Francesco Tapparo. \u201cA New Efficient Simulation Equivalence Algorithm\u201d. In: 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10\u201312 July 2007, Wroclaw, Poland, Proceedings. IEEE Computer Society, 2007, pp. 171\u2013180. https:\/\/doi.org\/10.1109\/LICS.2007.8.","DOI":"10.1109\/LICS.2007.8"},{"key":"20_CR33","doi-asserted-by":"publisher","unstructured":"Luke Schaeffer and Jeffrey Shallit. \u201cThe first-order theory of binary overlap-free words is decidable\u201d. In: Canadian Journal of Mathematics 76.4 (2024), pp. 1144\u20131162. https:\/\/doi.org\/10.4153\/S0008414X23000342.","DOI":"10.4153\/S0008414X23000342"},{"key":"20_CR34","unstructured":"Jeffrey Shallit. Adventures with an Automatic Prover. Online. Accessed: April 23, 2025. 2025. URL: https:\/\/cs.uwaterloo.ca\/~shallit\/Talks\/simons3.pdf."},{"key":"20_CR35","unstructured":"Jeffrey Shallit. Developing Walnut Commands for Sequence Properties. Online. Accessed: March 23, 2025. 2024. URL: https:\/\/cs.uwaterloo.ca\/~shallit\/Talks\/walnut-properties.pdf."},{"key":"20_CR36","doi-asserted-by":"crossref","unstructured":"Jeffrey Shallit. The Logical Approach to Automatic Sequences. Vol. 482. Cambridge University Press, 2022.","DOI":"10.1017\/9781108775267"},{"key":"20_CR37","unstructured":"Jeffrey Shallit. The Walnut Tutorial: Using A Tool for Doing Combinatorics on Words. Online. Accessed: March 23, 2025. 2021. URL: https:\/\/cs.uwaterloo.ca\/~shallit\/Talks\/walnut-unpaused.pdf."},{"key":"20_CR38","unstructured":"Jeffrey Shallit. Walnut Papers and Books (plus addenda). Online. Accessed: April 23, 2025. 2025. URL: https:\/\/cs.uwaterloo.ca\/~shallit\/walnut-papers.html."},{"key":"20_CR39","doi-asserted-by":"publisher","unstructured":"Jeffrey O. Shallit. \u201cThe Narayana Morphism and Related Words\u201d. In: CoRR abs\/2503.01026 (2025). arXiv: 2503.01026. https:\/\/doi.org\/10.48550\/ARXIV.2503.01026.","DOI":"10.48550\/ARXIV.2503.01026."},{"key":"20_CR40","doi-asserted-by":"publisher","unstructured":"Jeffrey O. Shallit, Sonja Linghui Shan, and Kai-Hsiang Yang. \u201cAutomatic sequences in negative bases and proofs of some conjectures of Shevelev\u201d. In: RAIRO Theor. Informatics Appl. 57 (2023), p. 4. https:\/\/doi.org\/10.1051\/ITA\/2022011.","DOI":"10.1051\/ITA\/2022011"},{"key":"20_CR41","doi-asserted-by":"publisher","unstructured":"Jeffrey O. Shallit, Arseny M. Shur, and Stefan Zorcics. \u201cPower-free complementary binary morphisms\u201d. In: J. Comb. Theory, Ser. A 207 (2024), p. 105910. https:\/\/doi.org\/10.1016\/J.JCTA.2024.105910.","DOI":"10.1016\/J.JCTA.2024.105910"},{"key":"20_CR42","doi-asserted-by":"publisher","unstructured":"Jeffrey O. Shallit and Ramin Zarifi. \u201cCircular critical exponents for Thue-Morse factors\u201d. In: RAIRO Theor. Informatics Appl. 53.1-2 (2019), pp. 37\u201349. https:\/\/doi.org\/10.1051\/ITA\/2018008.","DOI":"10.1051\/ITA\/2018008"},{"key":"20_CR43","unstructured":"Michael Sipser. Introduction to the theory of computation. PWS Publishing Company, 1997. ISBN: 978-0-534-94728-6."},{"key":"20_CR44","unstructured":"Vlad Slavici et al. \u201cFinding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks\u201d. In: CoRR abs\/1103.5736 (2011). arXiv: 1103.5736."},{"key":"20_CR45","unstructured":"Deian Tabakov. \u201cExperimental evaluation of explicit and symbolic automata-theoretic algorithms\u201d. Master\u2019s thesis. Rice University, USA, 2006. URL: https:\/\/hdl.handle.net\/1911\/17923."},{"key":"20_CR46","doi-asserted-by":"publisher","unstructured":"Deian Tabakov and Moshe Y. Vardi. \u201cExperimental Evaluation of Classical Automata Constructions\u201d. In: Logic for Programming, Artificial Intelligence, and Reasoning, 12th International Conference, LPAR 2005, Montego Bay, Jamaica, December 2\u20136, 2005, Proceedings. Ed. by Geoff Sutcliffe and Andrei Voronkov. Vol. 3835. Lecture Notes in Computer Science. Springer, 2005, pp. 396\u2013411. https:\/\/doi.org\/10.1007\/11591191_28.","DOI":"10.1007\/11591191_28"},{"key":"20_CR47","doi-asserted-by":"publisher","unstructured":"Valentin Touzeau et al. \u201cFast and exact analysis for LRU caches\u201d. In: Proc. ACM Program. Lang. 3.POPL (2019), 54:1\u201354:29. https:\/\/doi.org\/10.1145\/3290367.","DOI":"10.1145\/3290367"},{"key":"20_CR48","doi-asserted-by":"publisher","unstructured":"Mark Utting, Alexander Pretschner, and Bruno Legeard. \u201cA taxonomy of model-based testing approaches\u201d. In: Softw. Test. Verification Reliab. 22.5 (2012), pp. 297\u2013312. https:\/\/doi.org\/10.1002\/STVR.456.","DOI":"10.1002\/STVR.456"},{"key":"20_CR49","doi-asserted-by":"publisher","unstructured":"Antti Valmari. \u201cSimple Bisimilarity Minimization in $$O(m \\log n)$$ Time\u201d. In: Fundam. Informaticae 105.3 (2010), pp. 319\u2013339. https:\/\/doi.org\/10.3233\/FI-2010-369.","DOI":"10.3233\/FI-2010-369"},{"key":"20_CR50","unstructured":"Walnut GitHub page. Online. Accessed: Jan 12, 2026. URL: https:\/\/github.com\/Walnut-Theorem-Prover."},{"key":"20_CR51","doi-asserted-by":"publisher","unstructured":"Martin De Wulf et al. \u201cAntichains: A New Algorithm for Checking Universality of Finite Automata\u201d. In: Computer Aided Verification, 18th International Conference, CAV 2006, Seattle, WA, USA, August 17\u201320, 2006, Proceedings. Ed. by Thomas Ball and Robert B. Jones. Vol. 4144. Lecture Notes in Computer Science. Springer, 2006, pp. 17\u201330. https:\/\/doi.org\/10.1007\/11817963_5.","DOI":"10.1007\/11817963_5"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22749-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:28:54Z","timestamp":1782865734000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22749-2_20"}},"subtitle":["Reducing While Determinizing"],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227485","9783032227492"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22749-2_20","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":"15 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Markus Frohme is funded by Deutsche Forschungsgemeinschaft (DFG), Grant 528775176. The authors are directly involved with development of the presented tool, and declare they have no financial interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"The systems used in the experiments, the full results, and an executable Docker image for reproducing the data are available in Zenodo with identifier\n                      \n                      . For future use, the tool is maintained at\n                      \n                      .","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data-Availability Statement"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"11 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/about\/tacas\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}