{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T05:09:32Z","timestamp":1771045772009,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:00:00Z","timestamp":1719964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Strategic Instructional Innovations Program"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,3]]},"DOI":"10.1145\/3649217.3653599","type":"proceedings-article","created":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T18:30:20Z","timestamp":1720031420000},"page":"269-275","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["FSM Builder: A Tool for Writing Autograded Finite Automata Questions"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1476-6715","authenticated-orcid":false,"given":"Eliot Wong","family":"Robson","sequence":"first","affiliation":[{"name":"University of Illinois Urbana-Champaign, Urbana, IL, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4163-8509","authenticated-orcid":false,"given":"Sam","family":"Ruggerio","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign, Urbana, IL, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5253-2282","authenticated-orcid":false,"given":"Jeff","family":"Erickson","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign, Urbana, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"7","article-title":"Testing the Equivalence of Regular Languages","volume":"15","author":"Almeida Marco","year":"2009","unstructured":"Marco Almeida, Nelma Moreira, and Rog\u00e9rio Reis. 2009. Testing the Equivalence of Regular Languages. J. Autom. Lang. Comb. , Vol. 15 (2009), 7--25. https:\/\/api.semanticscholar.org\/CorpusID:9014414","journal-title":"J. Autom. Lang. Comb."},{"key":"e_1_3_2_1_2_1","volume-title":"Automated Grading of DFA Constructions. In IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence","author":"Alur Rajeev","year":"2013","unstructured":"Rajeev Alur, Loris D'Antoni, Sumit Gulwani, Dileep Kini, and Mahesh Viswanathan. 2013. Automated Grading of DFA Constructions. In IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3--9, 2013, Francesca Rossi (Ed.). IJCAI\/AAAI, 1976--1982. http:\/\/www.aaai.org\/ocs\/index.php\/IJCAI\/IJCAI13\/paper\/view\/6759"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3478431.3499416"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/971300.971349"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2038876.2038893"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--53291--8_1"},{"key":"e_1_3_2_1_7_1","volume-title":"Bull. EATCS","volume":"117","author":"D'Antoni Loris","year":"2015","unstructured":"Loris D'Antoni, Matthew Weavery, Alexander Weinert, and Rajeev Alur. 2015. Automata Tutor and what we learned from building an online teaching tool. Bull. EATCS , Vol. 117 (2015). http:\/\/eatcs.org\/beatcs\/index.php\/beatcs\/article\/view\/365"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.18260\/1-2--42347"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.21105\/joss.05759"},{"key":"e_1_3_2_1_10_1","volume-title":"Computer Science Curricula 2013: Curriculum Guidelines for Undergraduate Degree Programs in Computer Science","author":"Association for Computing Machinery (ACM) Joint Task Force on Computing Curricula and IEEE Computer Society. 2013.","unstructured":"Association for Computing Machinery (ACM) Joint Task Force on Computing Curricula and IEEE Computer Society. 2013. Computer Science Curricula 2013: Curriculum Guidelines for Undergraduate Degree Programs in Computer Science. Association for Computing Machinery, New York, NY, USA."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3408877.3432398"},{"key":"e_1_3_2_1_12_1","volume-title":"Algorithms for testing equivalence of finite automata, with a grading tool for JFLAP. (04","author":"Norton Daphne","year":"2009","unstructured":"Daphne Norton. 2009. Algorithms for testing equivalence of finite automata, with a grading tool for JFLAP. (04 2009)."},{"key":"e_1_3_2_1_13_1","volume-title":"JFLAP: An Interactive Formal Languages and Automata Package","author":"Rodger Susan H.","year":"2006","unstructured":"Susan H. Rodger. 2006. JFLAP: An Interactive Formal Languages and Automata Package. Jones and Bartlett Publishers, Inc., USA."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508865.1509011"},{"key":"e_1_3_2_1_15_1","unstructured":"M. Sipser. 2012. Introduction to the Theory of Computation. Cengage Learning. 45--47 pages. 2012938665"},{"key":"e_1_3_2_1_16_1","volume-title":"https:\/\/prairielearn.readthedocs.io\/en\/latest\/ Accessed","author":"Team PrairieLearn","year":"2024","unstructured":"PrairieLearn Team. 2021a. PrairieLearn Documentation. https:\/\/prairielearn.readthedocs.io\/en\/latest\/ Accessed: April 2024."},{"key":"e_1_3_2_1_17_1","volume-title":"PrairieLearn Question Element Documentation. https:\/\/prairielearn.readthedocs.io\/en\/latest\/devElements\/ Accessed","author":"Team PrairieLearn","year":"2024","unstructured":"PrairieLearn Team. 2021b. PrairieLearn Question Element Documentation. https:\/\/prairielearn.readthedocs.io\/en\/latest\/devElements\/ Accessed: April 2024."},{"key":"e_1_3_2_1_18_1","unstructured":"Evan Wallace. 2015. Finite State Machine Designer. Github repository. https:\/\/github.com\/evanw\/fsm"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.18260\/p.24575"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.18260\/p.24575"}],"event":{"name":"ITiCSE 2024: Innovation and Technology in Computer Science Education","location":"Milan Italy","acronym":"ITiCSE 2024","sponsor":["SIGCSE ACM Special Interest Group on Computer Science Education"]},"container-title":["Proceedings of the 2024 on Innovation and Technology in Computer Science Education V. 1"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649217.3653599","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649217.3653599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T14:48:06Z","timestamp":1755787686000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649217.3653599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,3]]},"references-count":20,"alternative-id":["10.1145\/3649217.3653599","10.1145\/3649217"],"URL":"https:\/\/doi.org\/10.1145\/3649217.3653599","relation":{},"subject":[],"published":{"date-parts":[[2024,7,3]]},"assertion":[{"value":"2024-07-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}