Some equivalence numbers and applications of fuzzy automation semi groups
Boletim da Sociedade Paranaense de Matemática · 20.12.2025 · 43 (4)
DOI: 10.5269/bspm.78559 ↗Kurz gefasst
Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 20.12.2025. Verfasst von L. Parimala und 1 weiteren Autor:innen. Die Arbeit nennt 15 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
This paper we give the proof of theorem of , Assuming that X be a finite set with n elements, and let S(n,r) (1 ≤ r ≤ n) be the number of equivalences Ï on X such that modX/r = r, to showing the equivalence of the relation S(n,1) = S(n,n) = 1,S(n,r) = S(n−1,r −1)+rS(n−1,r) = (2 ≤ r ≤n−1) and use the information to calculate S(n,r) for (1 ≤ r ≤ n ≤ 6). The numbers S(n,r) are the stirling number of the second kind [3]. S(n,r) is a symmetric semi-group or symmetric inverse semi-group depending upon the context. n is number of elements in base set and r is rank of elements. The study of fuzzy sub semi-groups and fuzzy ideals within algebraic structures like S(n,r). Fuzzy sub-sets of S(n,r) treating it as set of semi-groups.
Zitieren
APA
Parimala, L., & Reddy, E. K. (2025). Some equivalence numbers and applications of fuzzy automation semi groups. Boletim da Sociedade Paranaense de Matemática, 43(4). https://doi.org/10.5269/bspm.78559
Vancouver
Parimala L, Reddy EK. Some equivalence numbers and applications of fuzzy automation semi groups. Boletim da Sociedade Paranaense de Matemática. 2025;43(4). doi:10.5269/bspm.78559
BibTeX
@article{Parimala2025,
author = {Parimala, L. and Reddy, E. Keshava},
title = {Some equivalence numbers and applications of fuzzy automation semi groups},
journal = {Boletim da Sociedade Paranaense de Matemática},
year = {2025},
volume = {43},
number = {4},
doi = {10.5269/bspm.78559}
}
EUVIMED