Soft Computing

, Volume 21, Issue 10, pp 2477–2483 | Cite as

Some results in r-disjunctive languages and related topics



In this article, we summarize some new results on r-disjunctive languages and its related topics from some papers, these results form a new progress in this research area. In these results, we show the use of syntactic congruences (resp. syntactic monoids) of languages and the infix languages of languages in studying the characteristics, the decompositions and the classifications of the r-disjunctive languages. In addition, we set out some open problems in this area proposed in these papers.


r-Disjunctive languages r-Regular languages Syntactic congruences Syntactic monoids Decomposition Completely infix-k-disjunctive languages Trivially infix-k-disjunctive languages Properly partially infix-k-disjunctive languages 


Compliance with ethical standards

Conflict of interest

The authors declare that they have no conflict of interest.


  1. Guo YQ, Shyr HJ, Thierrin G (1986a) F-disjunctive language. Int J Comput Math 18(3–4):219–237CrossRefMATHGoogle Scholar
  2. Guo YQ, Xu GW, Thierrin G (1986b) Disjunctive decomposition of languages. Theor Comput Sci 46(1):47–51MathSciNetCrossRefMATHGoogle Scholar
  3. Guo YQ, Reis CM, Thierrin G (1988) Relatively f-disjunctive languages. Semigroup Forum 37(1):289–299MathSciNetCrossRefMATHGoogle Scholar
  4. Howie JM (1991) Automata and languages. Clarendon Press, OxfordMATHGoogle Scholar
  5. Lallement G (1979) Semigroups and combinatorial applications. Wiley Interscience, New YorkMATHGoogle Scholar
  6. Liu Y (2006) Studies on some languages and their syntactic semigroups, Ph.D. thesis. Sun Yat-Sen UniversityGoogle Scholar
  7. Liu Y, Shum KP, Guo YQ (2008) Relatively regular languages and thin codes. Eur J Comb 29(1):261–267MathSciNetCrossRefMATHGoogle Scholar
  8. Mu LW (1988) Some kinds of generalized disjunctive languages, Master’s thesis. Harbin Institute of TechnologyGoogle Scholar
  9. Shyr HJ (1980) Ordered catenation and regular free disjunctive languages. Inf Control 46(3):257–269MathSciNetCrossRefMATHGoogle Scholar
  10. Shyr HJ (2001) Free monoids and languages, 3rd edn. Hon Min Book Company, Taichung, TaiwanGoogle Scholar
  11. Shyr HJ, Thierrin G (1977) Disjunctive languages and codes, fundamentals of computation theory. In: Proceedings of the 1977 international FCT-conference, Poznan, lecture notes in computer science no. 56. Springer, Berlin, pp 171–176Google Scholar
  12. Shyr HJ, Yu SS (1990) Solid codes and disjunctive domains. Semigroup Forum 41(1):23–37MathSciNetCrossRefMATHGoogle Scholar
  13. Shyr HJ, Yu SS (1998) Midst-languages. Soochow J Math 24(2):113–130Google Scholar
  14. Wang SF, Guo YQ, Xu SX (2011) PS-regular languages. Int J Comput Math 88(12):2464–2484MathSciNetCrossRefMATHGoogle Scholar
  15. Zhang D, Guo YQ, Shum KP (2014) On some decompositions of r-disjunctive languages. Bull Malays Math Sci Soc 37(3):727–746MathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2017

Authors and Affiliations

  1. 1.Department of MathematicsGuangdong University of EducationGuangzhouChina
  2. 2.School of Mathematics and StatisticsLanzhou UniversityLanzhouChina
  3. 3.Institute of MathematicsYunnan UniversityKunmingChina

Personalised recommendations