Design Support for Multitape Turing Machines

Many Formal Languages and Automata Theory courses introduce students to Turing machine extensions.One of the most widely-used extensions endows Turing machines with multiple tapes.Although multitape Turing machines are an abstraction to simplify Turing machine design, students find them no less challenging.To aid students in understanding these machines, the FSM programming language provides support for their definition and execution.This, however, has proven insufficient for many students to understand the operational semantics of such machines and to understand why such machines accept or reject a word.To address this problem, three visualization tools have been developed.The first is a dynamic visualization tool that simulates machine execution.The second is a static visualization tool that automatically renders a graphic for a multitape Turing machine's transition diagram.The third is a static visualization tool that automatically renders computation graphs for multitape Turing machines.This article presents these tools and illustrates how they are used to help students design and implement multitape Turing machines.In addition, empirical data is presented that suggests these tools are well-received and found useful by students.