摘要
利用字语言与自动机理论,研究(n,k)-语言及左-(n,k)-语言的相关性质,进一步得到了一些结论,丰富了(n,k)-语言及左-(n,k)-语言的性质。结论如下:(1)设AB是(n,k)-语言(或左-(n,k)-语言),若A(或B)是左(或右)奇异语言,则B(或A)是(n,k)-语言(或左-(n,k)-语言);(2)左-(n,k)-语言的集合在连接运算、并集、交集和补集运算下是封闭的。
By using the theory of word language and automata,this article studies the relevant properties of(n,k)-language and left-(n,k)-language,and further obtains some conclusions,which enrich the nature of(n,k)-language and left-(n,k)-language.The conclusions are as follows:(1)If AB is(n,k)-language(or left-(n,k)-language)and A(or B)is a left(or right)singular language,then B(or A)is(n,k)-language(or left-(n,k)-language);(2)The collection of left-(n,k)-languages is closed under join operation,union,intersection and complementation.
作者
刘莉
LIU LI(School of Mathematics and Computer Science,Yan′an University,Yan′an 716000,China)
出处
《延安大学学报(自然科学版)》
2020年第1期40-42,共3页
Journal of Yan'an University:Natural Science Edition
基金
国家自然科学基金(11471007)
陕西省教育厅基金资助(16JK1860)。