%0 Journal Article
%T THE CHARACTERIZATION FOR REGULAR LANGUAGES
正则语言的特征性质
%A Ye Ruifen
%A Shen Baiying
%A
叶瑞芬
%A 沈百英
%J 软件学报
%D 1995
%I
%X Common pumping lemma for regular languages characterizes the necessary condition that a language is regular. This paper gives several necessary and sufficient conditions and common pumping lemma and generalized pumping lemma are obtained as their consequence.
%K ormal languages
%K regular languages
%K pumping lemma
%K generalized pumping lemma
形式语言,正则语言,泵引理,广义泵引理
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=F8E8E392EFAE7AE82C197FCCA7DEEB4B&yid=BBCD5003575B2B5F&vid=B31275AF3241DB2D&iid=DF92D298D3FF1E6E&sid=1FF3CD54EFC256A1&eid=A4E67967A1AB25F0&journal_id=1000-9825&journal_name=软件学报&referenced_num=3&reference_num=2