[译]图灵机(C ++实现)
By robot-v1.0
本文链接 https://www.kyfws.com/applications/turing-machine-c-implementation-zh/
版权声明 本博客所有文章除特别声明外,均采用 BY-NC-SA 许可协议。转载请注明出处!
- 2 分钟阅读 - 731 个词 阅读量 0[译]图灵机(C ++实现)
原文地址:https://www.codeproject.com/Articles/3185/Turing-Machine-C-Implementation
原文作者:Alex Vinokur
译文由本站 robot-v1.0 翻译
前言
The C++-program simulates a Turing Machine (TM). TM is defined by input files: metafile, states file, alphabet file, transition file, input word(s) file(s).
C ++程序模拟了图灵机(TM). TM由输入文件定义:图元文件,状态文件,字母文件,过渡文件,输入单词文件.
-
网页(Web page)
-
资料下载(Downloads)
-
资源(Source)
-
原始运行日志(演示)(Raw run log (demo))
介绍(Introduction)
C ++程序模拟了图灵机(TM).(The C++-program simulates a Turing Machine (TM).) TM由输入文件定义:元文件,状态文件,字母文件,过渡文件,输入单词文件:(TM is defined by input files: metafile, states file, alphabet file, transition file, input word(s) file(s):)
- 图元文件的每一行都包含与某些图灵机相关的数据(磁带数量,状态文件名称,字母文件,转换文件,输入字文件).(Each row of metafile contains data related to some Turing machine (number of tapes, names of states file, alphabet file, transition file, input word(s) file(s)).)
- 状态文件包含初始状态,停止状态和内部状态的列表.(States file contains a list of initial, halting and internal states.)
- 字母包含空,输入和内部符号的列表.(Alphabet contains a list of empty, input and internal symbols.)
- 过渡的每一行都包含一些过渡规则.(Each row of transition contains some transition rule.)
- 输入字的每一行都包含某些磁带的输入字.(Each row of input word(s) contains input word for some tape.) A.V.Aho,J.E.Hopcroft,J.D.Ullman的" The Design and Analysis of Computer Algorithms [1976]“中的Turing Machine示例(回文识别)被用作Turing Machine的演示样本.(A Turing Machine example (Recognition of Palindromes) from ‘The Design and Analysis of Computer Algorithms [1976]’ by A.V.Aho, J.E.Hopcroft, J.D.Ullman (See examples 1.8, 1.9) is used as a demo sample of Turing Machine.)
许可
本文以及所有相关的源代码和文件均已获得The Code Project Open License (CPOL)的许可。
C++ Windows Win2K STL Visual-Studio Dev 新闻 翻译