| 摘要: |
| ω—语言是由有穷字母表∑上的一些无穷串组成的集合．被ω一有穷自动机接受的ω一语言称为ω一正则语言．作者曾从集合的角度描述了一类ω一正则语言，而不是传统地从生成或识别的角度来描述这一类正则语言．本文从集合的角度来描述更为广泛的一类ω一正则语言． |
| 关键词: ω—正则语言，ω一凸语言，广义ω一凸语言，闭的ω—语言． |
| DOI： |
| 分类号: |
| 基金项目: |
|
| THE SET oF c^)一REGULAR LANGUAGES |
|
Zhuang Lei,Meng Qingyuan,Su Jinxiang
|
| Abstract: |
| If∑is a finite alphabet。w--language is the set which consists of some infi—
nite strings over∑．e--regular language is the~o--language that be accepted by o--finte automata．The authors described a subclassω—language from set viewpoint．It cannot tradition that gives the subclass ω—regular language from generation or reeognizition．In this paper．the authors also show the subclass ω—regular language from set viewpoint．This subclass is more widely． |
| Key words: ω—regular language,ω—convex language,general ω—convex language,closed ω—language． |
