Soft Computing

, Volume 21, Issue 10, pp 2477–2483

Some results in r-disjunctive languages and related topics


DOI: 10.1007/s00500-017-2572-0

Cite this article as:
Zhang, D., Guo, Y. & Shum, K.P. Soft Comput (2017) 21: 2477. doi:10.1007/s00500-017-2572-0


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 

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