Abstract
In this chapter, we will investigate relatively regular languages and relatively disjunctive languages systematically. The two classes of languages are natural generalizations of regular languages and disjunctive languages respectively and relatively disjunctive languages are even a generalization of f-disjunctive languages discussed in the previous chapter. One of the main results of the chapter is that “In any finite alphabet, all languages are divided into two disjoint classes: relatively regular languages and relatively disjunctive languages”. This is a natural generalization of the classification of languages on one-letter alphabets, and in some sense, gives a corresponding classification of languages on finite alphabets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
J. Berstel, D. Perrin, Theory of Codes (Academic Press, Orlando, 1985)
P.H. Day, H.J. Shyr, Languages defined by some partial orders. Soochow J. Math. 9, 53–62 (1983)
Y.Q. Guo, C.M. Reis, G. Thierrin, Relatively f-disjunctive languages. Semigroup Forum 37, 289–299 (1988)
Y.J. Liu, Semigroup method in combinatorics on words. Ph. D. Thesis, Zhongshan University (2001)
Y. Liu, Studies on some languages and their syntactic semigroups. Ph. D. Thesis, Zhongshan University (2006)
Z.H. Liu, Y.Q. Guo, The concatenation of thin languages and r-disjunctive languages. J. Shandong Univ. (Nat. Sci.) 54(6), 2–7 (2019)
Y. Liu, K.P. Shum, Y.Q. Guo, Relatively regular languages and thin codes. Eur. J. Comb. 29, 261–267 (2008)
Z.H. Liu, Y.Q. Guo, J. Leng, The applications of solid codes to r-R and r-D languages. Soft Comput. 23(7), 10709–10716 (2019)
C.M. Reis, Infix congruences on a free monoid. Trans. Am. Math. Soc. 311(2), 727–737 (1989)
H.J. Shyr, Free Monoids and Languages, 3rd edn. (Hon Min Book Company, Taichung, 2001)
H.J. Shyr, S.S. Yu, Midst-languages. Soochow J. Math. 24(2), 113–130 (1998)
D. Zhang, Y.Q. Guo, K.P. Shum, On some decompositions of r-disjunctive languages. Bull. Malays. Math. Sci. Soc. 37(3), 727–746 (2014)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Guo, Y., Liu, Y., Wang, S. (2024). Relatively Disjunctive Languages and Relatively Regular Languages. In: Topics on Combinatorial Semigroups. Springer, Singapore. https://doi.org/10.1007/978-981-99-9171-6_6
Download citation
DOI: https://doi.org/10.1007/978-981-99-9171-6_6
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-9170-9
Online ISBN: 978-981-99-9171-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)