On Quotient Structures of Fuzzy Multiset Finite Automata

Singh, Anand Pratap; Dubey, M. K.; Perfilieva, Irina

doi:10.2991/asum.k.210827.023

Cited by 7 publications

(4 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In case of FMFA, algebraic concepts such as transformation semi-group and covering of FMFA have been studied by Sharma, Tiwari and Sharan [40]. Recently, Singh, Dubey and Perfilieva [45], introduced several congruence relations on multiset associated with FMFA and demonstrate that each of these congruence relations associates a semigroup with FMFA. In [45], an admissible relation on a FMFA has been defined to characterize the FMFA, and it was shown there that there exists an isomorphism between FMFA and the quotient structures on another FMFA.…”

Section: Discussionmentioning

confidence: 99%

“…Recently, Singh, Dubey and Perfilieva [45], introduced several congruence relations on multiset associated with FMFA and demonstrate that each of these congruence relations associates a semigroup with FMFA. In [45], an admissible relation on a FMFA has been defined to characterize the FMFA, and it was shown there that there exists an isomorphism between FMFA and the quotient structures on another FMFA. In this paper, we enrich the algebraic theory of FMFA by characterization of some algebraic concepts of FMFA, which are still not studied as mentioned in item (ii) above.…”

Section: Discussionmentioning

confidence: 99%

“…It is worth to mention here that the multiset automata and fuzzy multiset automata are generalized versions of classical and fuzzy automata whose inputs are multisets (bags), in these models of computations processing of a symbol does not follow any strict order, i.e., any symbol from'input bag' can be utilized without affecting the output. Furthermore, Wang and Li [43] studied the lattice-valued FMFA minimization problem and Pal and Tiwari [44] considered Brazozowaski's algorithm and the categorical approaches for the same, while Singh, Dubey and Perfilieva [45] discussed quotient structures of FMFA, and Gautam [46] studied l-valued FMFA and l-valued FMLs. Recently Yadav and Tiwari [47] provide a general categorical framework of minimal realization of fuzzy multiset languages.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Fuzzy Multiset Finite Automata: Some Algebraic and Lattice Theoretic Characterizations

Ruhela,

Syropoulos,

Yadav

et al. 2023

Preprint

View full text Add to dashboard Cite

The aim of this work is to broaden the theory of computation by making use of fuzzy sets and multisets, which are generalization of ordinary sets. We study fuzzy multiset finite automata (FMFA), which are characterized by the incorporation of vagueness when it comes to the choice of the next state and multiple occurrences of the same input symbol. The resulting automaton is a genaralization of both classical automata and fuzzy automata. We discuss the algebraic characteristics of FMFA sub-automata—separatedness, strongly connectedness, cyclic, directable, and triangular FMFA in terms of equivalence classes induced by an equivalence relation defined on state set of FMFA. Intrestingly, for a given FMFA, a new FMFA can be constructed that is a homomorphic image of the original FMFA. We define different posets structures that can be associated with a given FMFA and show that some of them are upper semilattices and discuss the inter-relationship of a given poset, a finite upper semilattice (FUSL), a FMFA and a posets/FUSL associated with a given FMFA. Finally, we introduce the concept of decomposition of a FMFA in two different ways and characterize the strongly connected, triangular and directable FMFA.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fuzzy Multiset Finite Automata: Some Algebraic and Lattice Theoretic Characterizations

Ruhela,

Syropoulos,

Yadav

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Fuzzy automata are used to handle system uncertainties more accurately, whereas classical automata fail to cater to the circumstances. Fuzzy automata have been frequently employed since the introduction of fuzzy technology and neural networks [3][4][5][6][7][8][9][10][11][12][13]. Furthermore, there were a variety of problems to be resolved, for example, medical diagnosis, car anti-crash radar, freeway management, urban road traffic control, and obstacle recognition in front of a vehicle, which required flexible, quick, and accurate decisions, and then, fuzzy neural network automata (FNNA) [14][15][16][17] are an excellent choice.…”

Section: Introductionmentioning

confidence: 99%

Fault Diagnosis in Regenerative Braking System of Hybrid Electric Vehicles by Using Semigroup of Finite-State Deterministic Fully Intuitionistic Fuzzy Automata

Kousar

Aslam

Kausar

et al. 2022

Computational Intelligence and Neuroscience

View full text Add to dashboard Cite

Regenerative braking is one of the most promising and ecologically friendly solutions for improving energy efficiency and vehicle stability in electric and hybrid electric cars. This research describes a data-driven method for detecting and diagnosing issues in hybrid electric vehicle regenerative braking systems. Early fault identification can help enhance system performance and health. This study is centered on the construction of an inference system for fault diagnosis in a generalized fuzzy environment. For such an inference system, finite-state deterministic fully intuitionistic fuzzy automata (FDFIFA) are established. Semigroup of FDFIFA and its algebraic properties including substructures and structure-preserving maps are investigated. The inference system uses FDFIFA semigroups as variables, and FDFIFA semigroup homomorphisms are employed to illustrate the relationship between variables. The newly established model is then applied to diagnose the possible fault and their nature in the regenerative braking systems of hybrid electric vehicles by modeling the performance of superchargers and air coolers. The method may be used to evaluate faults in a wide range of systems, including autos and aerospace systems.

show abstract

On reduced fuzzy multiset finite automata

Shamsizadeh

Zahedi

2022

Soft Comput

View full text Add to dashboard Cite

On Quotient Structures of Fuzzy Multiset Finite Automata

Cited by 7 publications

References 19 publications

Fuzzy Multiset Finite Automata: Some Algebraic and Lattice Theoretic Characterizations

Fuzzy Multiset Finite Automata: Some Algebraic and Lattice Theoretic Characterizations

Fault Diagnosis in Regenerative Braking System of Hybrid Electric Vehicles by Using Semigroup of Finite-State Deterministic Fully Intuitionistic Fuzzy Automata

On reduced fuzzy multiset finite automata

Contact Info

Product

Resources

About