标题： 多带图灵机的设计支持 显示英文标题

标题： Design Support for Multitape Turing Machines

摘要： 许多形式语言与自动机理论课程会向学生介绍图灵机的扩展。 其中最广泛使用的扩展是为图灵机提供多条磁带。 尽管多带图灵机是一种简化图灵机设计的抽象，但学生们发现它们并不比单带图灵机更容易理解。 为了帮助学生理解这些机器，FSM编程语言提供了它们的定义和执行支持。 然而，这已被证明对于许多学生来说不足以理解这些机器的操作语义，以及为什么这些机器接受或拒绝一个单词。 为了解决这个问题，开发了三种可视化工具。 第一个是动态可视化工具，用于模拟机器的执行。 第二个是静态可视化工具，能够自动生成多带图灵机转移图的图形。 第三个是静态可视化工具，能够自动生成多带图灵机的计算图。 本文介绍了这些工具，并说明了它们如何帮助学生设计和实现多带图灵机。 此外，还提供了实证数据，表明这些工具受到学生的欢迎并被认为是有用的。 显示英文摘要

摘要： 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.