###
DOI:
Journal of Software:1990.1(3):29-32

一类ω—正则语言
苏锦祥
(郑州大学)
A CLASS ω-REGULAR LANGUAGES
Su Jinxiang
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 3240   Download 2717
Received:August 27, 1989    
> 中文摘要: ω—语言是由有穷字母表∑上的某些无穷串组成的集合。被所谓的ω—有穷自动机接受的ω—语言称为ω—正则语言。在[4]中作者曾从集合的角度给出—ω—语言为ω—正则语言的几个充分条件。在本文作者仍从集合的角度给出一个ω—语言为ω—正则语言的充分条件,即若—ω—凸语言L满足L=adh(pref(L))=pref(L)tail(L),则L是—ω—正则语言。从而,确定了ω—正则语言类的一个子类。
中文关键词:
Abstract:An ω-language is a set consisting of infinite-strings over some alphabet ∑, the ω-language accepted by some ω-finite state automation is called the ω-regular language.Several sufficient conditions for an ω-language is an ω-regular language are given by author from the point of view of the set in [4]. In this paper, author gives still from the point of view of the set a sufficient condition for an ω-language is an ω-regular language, i.e., if L is an ω-convex language, such that L=Adh(pref(L)) =Pref(L)Tail(L),then the L is an ω-regular language.Thus defined one subclass of the ω-regular languages class.
keywords:
文章编号:     中图分类号:    文献标志码:
基金项目:
Foundation items:
Author NameAffiliation
Su Jinxiang 郑州大学 
Reference text:

苏锦祥.一类ω—正则语言.软件学报,1990,1(3):29-32

Su Jinxiang.A CLASS ω-REGULAR LANGUAGES.Journal of Software,1990,1(3):29-32