图灵机实现由相同个数的0和1的团组成的串
用图灵机设计实现由相同个数的0和1的团组成的串。例如:00001111符合条件,00110011或00011111不符合条件。
该图灵机由5个状态{q0,q1,q2,q3,q4}组成,状态转换过程如下:
(q0,0)=(q1,X,R)
(q0,Y)=(q3,Y,R)
(q1,0)=(q1,0,R)
(q1,1)=(q2,Y,L)
(q1,Y)=(q1,Y,R)
(q2,0)=(q2,0,L)
(q2,X)=(q0,X,R)
(q2,Y)=(q2,Y,L)
(q3,Y)=(q3,Y,R)
(q3,B)=(q4,B,R)
实现如下:
#define _CRT_NO_SECURE_WARNINGS
#include<iostream>
#define LEN 12
#define STA 5
using namespace std;
int main()
{
char str[LEN] = {};
printf("请按要求输入12个字符\n(前两个字符和后两个字符为'B',中间八个字符为'0'和'1'组成的串)\n-> ");
for (int i = 0; i < LEN; i++)
{
scanf("%c", &str[i]);
}
int tm = 0;
int id = 2;
while (true)
{
cout << "[ state:" << tm << "\tid:" << id << "\t]\t";
for (int i = 0; i < LEN; i++)
{
cout << str[i] << " ";
}
cout << endl;
switch (tm)
{
case 0:
{
if (str[id] == '0')
{
str[id] = 'X';
id++;
tm = 1;
continue;
}
else if (str[id] == 'Y')
{
id++;
tm = 3;
continue;
}
else break;
}
case 1:
{
if (str[id] == '0' || str[id] == 'Y')
{
id++;
continue;
}
else if (str[id] == '1')
{
str[id] = 'Y';
id--;
tm = 2;
continue;
}
else break;
}
case 2:
{
if (str[id] == '0' || str[id] == 'Y')
{
id--;
continue;
}
else if (str[id] == 'X')
{
id++;
tm = 0;
continue;
}
else break;
}
case 3:
{
if (str[id] == 'Y')
{
id++;
continue;
}
else if (str[id] == 'B')
{
id++;
tm = 4;
continue;
}
else break;
}
case 4:break;
}
if (tm == 4)break;
}
return 0;
}
运行结果如图:
(若串符合规则,图灵机到达终结状态,则程序正常结束,否则图灵机无法到达终结状态,程序陷入死循环)