| 正则语言的可递归性 |
| |
| 引用本文： | 闵兰,陈晓敏.正则语言的可递归性[J].重庆邮电学院学报(自然科学版),2009(6). |
| |
| 作者姓名： | 闵兰 陈晓敏 |
| |
| 作者单位： | 成都理工大学信息管理学院;成都电子机械高等专科学校信息与计算科学系; |
| |
| 摘 要： | 根据可计算理论,形式语言的递归性是计算机产生和识别形式语言的基础。从正则语言识别的角度证明了正则语言的识别系统确定有限自动机所识别的语言集是一个递归可枚举集,同时讨论了正则语言的可递归性。有助于进一步研究正则语言的自动产生机制。
|
| 关 键 词： | 正则文法 确定有限自动机 递归可枚举集 |
Recursiveness of regular language |
| |
| MIN Lan,CHEN Xiao-min.Recursiveness of regular language[J].Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition),2009(6). |
| |
| Authors: | MIN Lan CHEN Xiao-min |
| |
| Institution: | MIN Lan1,CHEN Xiao-min2(1.College of Information Management,Chengdu University of Technology,Chengdu 610059,P.R.China,2.Department of Information , Computing Science,Chengdu Electromechanical College,Chengdu 610031,P.R.China) |
| |
| Abstract: | Based on the theory of computability,the recursiveness of formal language is the base to produce and distinguish formal language by computer.The theorem that the language set distinguished deterministic finite automaton is a recursively enumerable set was proved,and then,the recursiveness of regular language was analyzed.This study is helpful to research on the manner of automatic production regular language. |
| |
| Keywords: | regular grammar deterministic finite automaton recursively enumerable set |
| 本文献已被 CNKI 等数据库收录！ |
|
