摘要
某些语言中的所有句子必须包含有或者不能包含有特定的子串,或者需要将语言中句子所包含的子串进行替换。传统的方法是利用图灵机的存储技术处理该类语言。该文提出了一种图灵机扫描子串技术的新方法,即将特定子串当作一个整体,将扫描一个符号的图灵机的多个状态转换函数合并为一个,使得图灵机一次可以扫描多个符号,但图灵机的读/写头仅移动一个单元。该方法简便且有效,通过实例证明了扫描多个符号的图灵机与扫描一个符号的图灵机是等价的。
In some languages, all the sentences must include or exclude some specific substrings. Sometimes, the substrings must be replaced. It is difficult for a Turing machine to accept such languages. Traditional method is based on the storage technique. In this paper, we present a new method, the scanning substring techonology. In the method, the specific substring is treated as a single unit. Multiple status transition functions of the Turing machine are combined to scan multiple characters at one time, but the read/write head only moves one unit. Through some examples, the paper shows that the Turing machine which scans multiple characters is equivalent to a Turing machine scanning one character.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2009年第2期270-273,共4页
Journal of University of Electronic Science and Technology of China
基金
Supported by the Sichuan science and technology(2006J13-068)~~
作者简介
陈文宇（1968-），男，副教授，主要从事形式语言与自动机理论、面向对象技术方面的研究．
