Volume 38 Issue 2
May  2017
Article Contents
Article Navigation >  Journal of University of Electronic Science and Technology of China  > 2009  >  38(2): 270-273

CHEN Wen-yu, CHENG Xiao-ou, SUN Shi-xin. Technology of Scanning Substring by Turing Machine[J]. Journal of University of Electronic Science and Technology of China, 2009, 38(2): 270-273. doi: 10.3969/j.issn.1001-0548.2009.02.27
Citation: CHEN Wen-yu, CHENG Xiao-ou, SUN Shi-xin. Technology of Scanning Substring by Turing Machine[J]. Journal of University of Electronic Science and Technology of China, 2009, 38(2): 270-273. doi: 10.3969/j.issn.1001-0548.2009.02.27
shu

Technology of Scanning Substring by Turing Machine

doi: 10.3969/j.issn.1001-0548.2009.02.27
  • 1.

    School of Computer Science and Engineering,University of Electronic Science and Technology of China Chengdu 610054

Funds:

Supported by the Sichuan science and technology(2006J13-068)

  • Received Date: 2007-09-15
  • Rev Recd Date: 2008-01-20
  • Publish Date: 2009-04-15
  • 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.
  • 加载中
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索
Get Citation
PDF
XML

Article Metrics

Article views(3654) PDF downloads(62) Cited by()

Related
Proportional views

Technology of Scanning Substring by Turing Machine

doi: 10.3969/j.issn.1001-0548.2009.02.27
  • 1. School of Computer Science and Engineering,University of Electronic Science and Technology of China Chengdu 610054
Funds:

Supported by the Sichuan science and technology(2006J13-068)

  • Received Date: 2007-09-15
  • Rev Recd Date: 2008-01-20
  • Publish Date: 2009-04-15

Abstract: 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.

CHEN Wen-yu, CHENG Xiao-ou, SUN Shi-xin. Technology of Scanning Substring by Turing Machine[J]. Journal of University of Electronic Science and Technology of China, 2009, 38(2): 270-273. doi: 10.3969/j.issn.1001-0548.2009.02.27
Citation: CHEN Wen-yu, CHENG Xiao-ou, SUN Shi-xin. Technology of Scanning Substring by Turing Machine[J]. Journal of University of Electronic Science and Technology of China, 2009, 38(2): 270-273. doi: 10.3969/j.issn.1001-0548.2009.02.27
shu

    HTML

Catalog

    Journal Online

    Author's Notes

    Links

    Copyright © 《电子科技大学学报》编辑部

    Address: Room 350, central building, University of Electronic Science and Technology, No.4, Section 2, Jianshe North Road, Chengdu Tel: 028-83202308,83207559 Email: xuebao@uestc.edu.cn

    本系统由 北京仁和汇智信息技术有限公司 开发 

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return