{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:27Z","timestamp":1750220187875,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,9]],"date-time":"2022-11-09T00:00:00Z","timestamp":1667952000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,9]]},"DOI":"10.1145\/3561833.3561839","type":"proceedings-article","created":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T17:06:09Z","timestamp":1670605569000},"page":"8-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Automated Generation and Grading for Finite State Machine Assignments"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9677-6791","authenticated-orcid":false,"given":"Dhruva","family":"Kashyap","sequence":"first","affiliation":[{"name":"Computer Science and Engineering, PES University, India"}],"role":[{"role":"author","vocab":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0353-6145","authenticated-orcid":false,"given":"Manu","family":"Bhat","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, PES University, India"}],"role":[{"role":"author","vocab":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8831-0625","authenticated-orcid":false,"given":"NS","family":"Kumar","sequence":"additional","affiliation":[{"name":"Kumaradhara consultancy, India"}],"role":[{"role":"author","vocab":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,12,9]]},"reference":[{"volume-title":"Graphviz and dynagraph \u2013 static and dynamic graph drawing tools","author":"Ellson John","key":"e_1_3_2_1_1_1","unstructured":"John Ellson , Emden\u00a0 R. Gansner , Eleftherios Koutsofios , Stephen\u00a0 C. North , and Gordon Woodhull . 2003. Graphviz and dynagraph \u2013 static and dynamic graph drawing tools . In GRAPH DRAWING SOFTWARE. Springer-Verlag , 127\u2013148. John Ellson, Emden\u00a0R. Gansner, Eleftherios Koutsofios, Stephen\u00a0C. North, and Gordon Woodhull. 2003. Graphviz and dynagraph \u2013 static and dynamic graph drawing tools. In GRAPH DRAWING SOFTWARE. Springer-Verlag, 127\u2013148."},{"key":"e_1_3_2_1_2_1","unstructured":"John\u00a0E. Hopcroft and Richard\u00a0M. Karp. 1971. A Linear Algorithm for Testing Equivalence of Finite Automata.  John\u00a0E. Hopcroft and Richard\u00a0M. Karp. 1971. A Linear Algorithm for Testing Equivalence of Finite Automata."},{"key":"e_1_3_2_1_3_1","volume-title":"Algorithms for testing equivalence of finite automata, with a grading tool for JFLAP. RIT Scholar Works","author":"Norton Daphne","year":"2009","unstructured":"Daphne Norton . 2009. Algorithms for testing equivalence of finite automata, with a grading tool for JFLAP. RIT Scholar Works ( 2009 ). https:\/\/scholarworks.rit.edu\/theses\/6939\/ Daphne Norton. 2009. Algorithms for testing equivalence of finite automata, with a grading tool for JFLAP. RIT Scholar Works (2009). https:\/\/scholarworks.rit.edu\/theses\/6939\/"},{"key":"e_1_3_2_1_4_1","unstructured":"Python. 2022. Regular expression operations. https:\/\/docs.python.org\/3\/library\/re.html  Python. 2022. Regular expression operations. https:\/\/docs.python.org\/3\/library\/re.html"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1124706.1121459"},{"key":"e_1_3_2_1_6_1","unstructured":"Itiroo Sakai. 1961. Syntax in universal translation. In EARLYMT.  Itiroo Sakai. 1961. Syntax in universal translation. In EARLYMT."}],"event":{"name":"COMPUTE 2022: COMPUTE 2022","acronym":"COMPUTE 2022","location":"Jaipur India"},"container-title":["Proceedings of the 15th Annual ACM India Compute Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3561833.3561839","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3561833.3561839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:24Z","timestamp":1750186944000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3561833.3561839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,9]]},"references-count":6,"alternative-id":["10.1145\/3561833.3561839","10.1145\/3561833"],"URL":"https:\/\/doi.org\/10.1145\/3561833.3561839","relation":{},"subject":[],"published":{"date-parts":[[2022,11,9]]},"assertion":[{"value":"2022-12-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}