On f-Disjunctive Languages, f-Disjunctive Domains and Solid Codes(Dedicated to the late Professor Xu Yonghua (1932-2019))  

作　　者：Jing Leng Yuqi Guo K.P.Shum 

机构地区：[1]School of Mathematics and Statistics Lanzhou University,Lanzhou 730000,China [2]Institute of Mathematics,Yunnan University Kunming 650091,China

出　　处：《Algebra Colloquium》2020年第2期331-342,共12页代数集刊（英文版）

摘　　要：Every language is either the disjoint union or the intersection of two disjunctive languages.The family of f-disjunctive languages is a natural generalization of the family of disjunctive languages.Disjunctive domains(f-disjunctive domains)are defined as the languages which can be checked whether a given language is disjunctive(f-disjunctive)or not.The f-disjunctive domains were first studied by Guo et al.around 1986-1989.We continue their study on f-disjunctive domains.Some new results for f-disjunctive domains,containing a relation between disjunctive domains and f-disjunctive domains,are introduced.In this respect,we also make an appropriate opening for the completely dense languages and solid codes.

关 键 词：f-disjunctive languages f-disjunctive domains completely dense languages solid codes 

分 类 号：O15[理学—数学]