FSM Builder: A Tool for Writing Autograded Finite Automata Questions
Eliot W. Robson, Sam Ruggerio, Jeff Erickson · 2024
Deterministic and nondeterministic finite automata (DFAs and NFAs) are abstract models of computation commonly taught in introductory computing theory courses. These models have important applications (such as fast regular expression matching), and are used to introduce formal language theory. Undergraduate students often struggle with understanding these models at first, due to the level of abstraction. As a result, various pedagogical tools have been developed to allow students to practice with these models.