Automatic Automata Grading System Using JFLAP

This study focuses on the automatic grading of exams in the “theory of computation” course using JFLAP, an open source system. In the study, the source codes of JFLAP are arranged and two interfaces are presented, one for the student and the other for the evaluator. Practical exams with JFLAP support cover three topics: Finite Automata (FA), Pushdown Automata (PDA), Turing Machines (TM). In the student interface, files are sent to a server as soon as responses are recorded using traditional JFLAP. The evaluator adds an answer key to the same folder as the student files on the server and clicks the auto-grading button in the evaluator interface. The student file cannot get points unless more than half of the balanced distributed accept and reject samples in the answer key are correct. This approach reduces the time and subjective interpretation costs associated with traditional assessments, especially in large classrooms. The system’s performance analysis shows increased exam participation and classroom interaction without affecting ultimate success. It is expected that the success rates of students who make more preparations in future studies will increase.