Skip to main content
Log in

Some results in r-disjunctive languages and related topics

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. Quoted from the paper “Yuqi Guo, Di Zhang and K. P. Shum, The infix-k-Disjunctive Classification of r-Disjunctive Languages (to be submitted).”

References

  • Guo YQ, Shyr HJ, Thierrin G (1986a) F-disjunctive language. Int J Comput Math 18(3–4):219–237

    Article  MATH  Google Scholar 

  • Guo YQ, Xu GW, Thierrin G (1986b) Disjunctive decomposition of languages. Theor Comput Sci 46(1):47–51

    Article  MathSciNet  MATH  Google Scholar 

  • Guo YQ, Reis CM, Thierrin G (1988) Relatively f-disjunctive languages. Semigroup Forum 37(1):289–299

    Article  MathSciNet  MATH  Google Scholar 

  • Howie JM (1991) Automata and languages. Clarendon Press, Oxford

    MATH  Google Scholar 

  • Lallement G (1979) Semigroups and combinatorial applications. Wiley Interscience, New York

    MATH  Google Scholar 

  • Liu Y (2006) Studies on some languages and their syntactic semigroups, Ph.D. thesis. Sun Yat-Sen University

  • Liu Y, Shum KP, Guo YQ (2008) Relatively regular languages and thin codes. Eur J Comb 29(1):261–267

    Article  MathSciNet  MATH  Google Scholar 

  • Mu LW (1988) Some kinds of generalized disjunctive languages, Master’s thesis. Harbin Institute of Technology

  • Shyr HJ (1980) Ordered catenation and regular free disjunctive languages. Inf Control 46(3):257–269

    Article  MathSciNet  MATH  Google Scholar 

  • Shyr HJ (2001) Free monoids and languages, 3rd edn. Hon Min Book Company, Taichung, Taiwan

  • 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–176

  • Shyr HJ, Yu SS (1990) Solid codes and disjunctive domains. Semigroup Forum 41(1):23–37

    Article  MathSciNet  MATH  Google Scholar 

  • Shyr HJ, Yu SS (1998) Midst-languages. Soochow J Math 24(2):113–130

  • Wang SF, Guo YQ, Xu SX (2011) PS-regular languages. Int J Comput Math 88(12):2464–2484

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang D, Guo YQ, Shum KP (2014) On some decompositions of r-disjunctive languages. Bull Malays Math Sci Soc 37(3):727–746

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yuqi Guo.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Communicated by Y. Yang.

The research was supported by the National Natural Science Foundation of China (Grant No. 11371177).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, D., Guo, Y. & Shum, K.P. Some results in r-disjunctive languages and related topics. Soft Comput 21, 2477–2483 (2017). https://doi.org/10.1007/s00500-017-2572-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-017-2572-0

Keywords

Navigation