摘要
给出了接受语言L={0n1n|n≥0}的仅有3个状态的图灵机的一种设计,其方法是通过对带符号的配合使用来控制图灵机带头移动的方向,达到精减图灵机状态数的目的,并采用C语言编程实现.
This paper shows a design of only 3-state Turing machine for accepting L ={0^n1^n│n≥0}. Its method is to control the moving direction of the TM＇ s tape head by using the tape symbols cooperatively so as to reduce the number of states of the TM. The design is implemented in C programming.
出处
《淮阴师范学院学报（自然科学版）》
CAS
2006年第2期158-161,共4页
Journal of Huaiyin Teachers College;Natural Science Edition
关键词
图灵机
带符号
状态数
算法设计
turing machine
tape symbol
number of state
algorithm design
