题目: 对于XN+1或XN*2图灵机进行模拟,任意给定的十进制数a,转换为收缩扩展二进制的编码,再编程模拟此Turing机的运行过程,要求输出从开始运行起的每一步骤的结果。 用C或C++或java或python语言实现程序解决问题。
算法描述:
代码实现:
#dict1用于进制扩展 ,dict2用于寻找对应的操作
dict1 = {'0':'0','1':'10',',':'1100000'}
dict2 = {'00':'00','01':'10','10':'01','11':'100','100':'111','110':'01'}
#数字输入与格式转换
num = input('请输入一个数\n')
num = bin(int(num))
result = list(num)
result.append(',')
result = result[2::1]
for i in range(len(result)):
result[i] = dict1[result[i]]
temp = []
for i in result:
temp += list(i)
result = temp
print('输入进行扩展变化后为:')
print(temp)
#开始进行乘法操作
temp:str = '0'
res = []
print('开始进行乘2操作')
for i in range(len(result)):
temp2 = result[i]
temp +=temp2
temp2 = ''
res = list(dict2[temp])
result[i] = res.pop()
print(result)
temp = ''
for j in res:
temp +=j
if(temp == '11'and temp2 == '0'):
break
temp = ''
print('乘2后的结果:')
print(result)
#结果收缩
i = 0
while(i!=len(result)):
if(result[i]=='1'):
if(result[i+1]=='0'):
temp +='1'
i +=2
continue
if(result[i+1]=='1'):
break
temp +='0'
i +=1
print('结果收缩后为:\n'+temp)
temp = int(temp,2)
print('结果转化进制后为:')
print(temp)
代码调试:
结果测试: