Some Studies On The R-disjunctive Languages And R-regular Languages

The main results of this thesis are some studies on r-disjunctive languages and r-regular languages.Firstly,we investigate some kinds of decomposition of i-disjunctive languages,and by means of these results,we discuss the "longitudinal"disjunctive degree of the proper i-disjunctive languages.Secondly,some new results for disjunctive domains and f-disjunctive domains will be introduced.To this respec-t,we also make an appropriate opening out for the completely dense languages and solid codes.Moreover,we prove that there is no congruence on a free monoid which has a completely dense ?-class.Finally,we study some notes on opposite language of infix codes(prefix codes,suffix codes),that is,infix chains(prefix chains,suffix chains).And characterizations of the completely dense languages and the minimum Schreier cross-section contains only one branch are given.