#对XN2图灵机进行# 标题
实验内容:对于XN+1或XN*2图灵机进行模拟,任意给定的十进制数a,转换为收缩扩展二进制的编码,再编程模拟此Turing机的运行过程,要求输出从开始运行起的每一步骤的结果。 用C或C++或java或python语言实现程序解决问题。
1.算法分析
① 输入要进行计算的字符串
② 转化为数组
③ 将数值输出
④ 根据图灵机un+1的命令,每一步进行输出,最终 得到结果
2.概要设计(包括数据结构及算法绘制流程图或伪代码表示)
在这里插入#include<stdio.h>
#include<math.h>
#define N 1000
int ChangeBinarySystem(int a[], int x) //十进制数转换为二进制数
{
int cnt = 0, i;
printf("%d的二进制表示为:\n", x);
while (x) {
a[cnt++] = x % 2;
x = x / 2;
}
for (i = 0; i < cnt; i++) {
printf("%d", a[i]);
}
printf("\n");
return cnt - 1;
}
int ChangeTuringCode(int a[], int b[], int cnt) //二进制数转换为扩展二进制数
{
int cnt1 = 1, i;
b[0] = 0;
for (i = cnt; i >= 0; i--)
{
if (a[i] == 1) {
b[cnt1++] = 1;
b[cnt1++] = 0;
}
else b[cnt1++] = 0;
}
b[cnt1++] = 1;
b[cnt1++] = 1;
b[cnt1] = 0;
printf("该数的扩展二进位数为:\n");
for (i = 0; i < cnt1 + 1; i++) {
printf("%d", b[i]);
}
printf("\n");
return cnt1 + 1;
}
int RunTuring(int b[], int cnt1) //运行图灵机(XN×2)的指令运算
{
int state = 0, i = 0, j = 1, cnt = 0, k;
printf("运算步骤:\n");
while (j)
{
printf("%2d.", cnt + 1);
for (k = 0; k < (cnt < cnt1 ? cnt1 : cnt + 1); k++) {
printf("%d", b[k]);
}
printf("\n");
if (state == 0 && b[i] == 0) {
state = 0;
b[i++] = 0;
}
else if (state == 0 && b[i] == 1) {
state = 1;
b[i++] = 0;
}
else if (state == 1 && b[i] == 0) {
state = 0;
b[i++] = 1;
}
else if (state == 1 && b[i] == 1) {
state = 10;
b[i++] = 0;
}
else if (state == 10 && b[i] == 0) {
state = 11;
b[i++] = 1;
}
else if (state == 11 && b[i] == 0) {
state = 0;
b[i++] = 1;
j = 0;
}
cnt++;
}
printf("%2d.", cnt + 1);
for (k = 0; k < (cnt < cnt1 ? cnt1 : cnt + 1); k++) {
printf("%d", b[k]);
}
printf("\n");
return i + 1;
}
int ChangeNumber(int a[], int b[]) //运算后的扩展二进位数转换为二进制数
{
int i = 0, j = 1, k = 0, m;
while (j) {
if (b[i] == 1 && b[i + 1] == 1 && b[i + 2] == 0) {
j = 0;
}
else if (b[i] == 1 && b[i + 1] == 0) {
a[k++] = 1;
i = i + 2;
}
else if (b[i] == 0) {
a[k++] = 0;
i++;
}
}
printf("运算后的二进制数表示为:\n");
for (m = 2; m < k; m++) {
printf("%d", a[m]);
}
printf("\n");
return k;
}
int ChangeToDecimal(int a[], int k) //运算后的二进制数转换为十进制数
{
int sum = 0, i = 0;
for (k; k > -1; k--)
{
sum += pow(2, i)*a[k];
i++;
}
return sum;
}
int main(void)
{
int a[N], b[N] = { 0 }, x, x1, i, cnt, cnt1, cnt2, k, sum;
printf("请输入数字:\n");
scanf_s("%d", &x); //输入整数x
if (x < 0) { //如果x是负数,则先将x变为正数,进行运算
x1 = x;
x = -x;
}
cnt = ChangeBinarySystem(a, x); //十进制数转换为二进制数
cnt1 = ChangeTuringCode(a, b, cnt);
cnt2 = RunTuring(b, cnt1);
k = ChangeNumber(a, b);
sum = ChangeToDecimal(a, k - 1);
printf("运行结果为:\n");
if (x1 < 0) sum = sum-sum;
printf("%d\n", sum);
return 0;
}
插入代码片`代码片
这里是引用