Exploring Finite State Automata with Junun Robots: A Case Study in Computability Theory

摘要

A case study in computability theory is presented on teaching finite state automata with mobile robots. Junun Mark III robots were used in several coding assignments on finite state machines and a final coding project in an upper-level undergraduate course in computability theory. Software and hardware choices are discussed with respect to the robotic platform and the laboratory environment. Several guidelines are presented for integrating robots in theory of computation classes to reinforce and enhance students' understanding of finite state machines through practical applications of finite state control mechanisms.