稀疏语言与r-析取语言的连接

刘祖华^1,2,郭聿琦^1*

1.兰州大学数学与统计学院, 甘肃 兰州 730000;2.昆明学院数学学院, 云南 昆明 650214

发布日期:2019-06-05

作者简介:LIU Zu-hua(1981— ), Male, PhD.Student, Associate Professor, His research interests mainly include combinatorial semigroups. E-mail:liuzuhua@hotmail.com*Communication author⁽¹⁾ GUO Y Q, ZHANG D and SHUM K P. Some studies on infix-k-disjunctive degrees of r-disjunctive languages(to be submitted)
基金资助:SupportedbyNationalNaturalScienceFoundationofChina(11861071)

The concatenation of thin languages and r-disjunctive languages ——several studies on combinatorial semigroups(Ⅰ)

LIU Zu-hua^1,2, GUO Yu-qi^1*

1. School of Mathematics and Statistics, Lanzhou University, Lanzhou 730000, Gansu, China;
2. School of Mathematics, Kunming University, Kunming 650214, Yunan, China

Published:2019-06-05

摘要/Abstract

摘要： 综合了文献［1］与郭聿琦⁽¹⁾等的另一篇文章中的几个事实, 得到了命题1:若L1L∈D_f(D_t, D_r),则L∈D_f(D_t, D_r),其中L₁, L为字母表A上语言且L₁有限。关于命题1中的D_r情形,给出了一个新的简单证明。还证明了:关于D和D_i, 命题1也成立。进一步将命题1中L₁从“有限的”改扩成“稀疏的”后,关于D,D_f和D_t命题仍然成立;又用例子指出关于D_i和D_r命题并不成立。


PDF全文下载地址:

http://lxbwk.njournal.sdu.edu.cn/CN/article/downloadArticleFile.do?attachType=PDF&id=3086