计算机科学 ›› 2010, Vol. 37 ›› Issue (1): 243-244.

• 人工智能 • 上一篇    下一篇

形式语言与自动机中关于ε的一些问题

陈文宇,王晓斌,程小鸥,孙世新   

  1. (电子科技大学计算机科学与工程学院 成都610054)
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受863计划(2006AA01Z174)资助。

Issues Regarding ε in Formal Language and Automata Theory

CHEN Wen-yu,WANG Xiao-bin,CHENG Xiao-ou,SUN Shi-xin   

  • Online:2018-12-01 Published:2018-12-01

摘要: 讨论了形式语言与自动机理论中关于空串ε的一些问题。分析了ε产生式对文法和语言分类的影响;从文法和有限状态自动机的角度讨论了开始符号S和开始状态q。的作用;提出了语言增加或减少ε句子的简单方法;研究了ε-NFA的ε状态转换函数的本质;提出了ε-NFA转换为NFA的新方法,即先将ε-NFA转换为文法形式,消除ε产生式和单产生式后得到正则文法,再将正则文法转换为NFA。并用实际例子进行了验证。

关键词: ε句子,ε产生式,ε状态转换函数,带ε动作的有限状态自动机

Abstract: The paper discussed some issues regarding blank string a in the formal language and automata theory. After analysis of the influence of production c on grammar and language classification,the paper discussed the effect of starting symbol S and the starting state qo from the perspective of grammer and infinite state and proposed a simple method to increase language or decrease sentence ε. The paper also proposed a new method to transit ε-NFA to NFA after studying the essence of a state transition function of E-NFA. The method is:first transit ε-NFA to formal grammar and elimmate production ε and single production. After that, regular grammar was obtained. Then transited regular grammar to NFA. Examples were given to support the discussion.

Key words: ε-sentence,ε-producer, ε-state transform function,ε-NFA

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!