On Algebraic Study of Fuzzy Multiset Finite Automata

Sharma, Bhudev; Tiwari, S. P.; Sharan, Shambhu

doi:10.1016/j.fiae.2016.09.001

Cited by 14 publications

(11 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…e recent contribution to the study of fuzzy multiset automata and fuzzy multiset languages is due to Sharma et al [76,77], Wang and Li [64], Pal and Tiwari [78], and Tiwari et al [79].…”

Section: Introductionmentioning

confidence: 99%

A General Categorical Framework of Minimal Realization Theory for a Fuzzy Multiset Language

Yadav

Tiwari

2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper is to study the minimal realization theory for a fuzzy multiset language in the framework of category theory, which has already provided the tools and techniques for the advancement of several features of theoretical computer science. Specifically, by using the well-known categorical concepts, it is shown herein that there is a minimal realization (called the Nerode realization) for each fuzzy multiset language, and all minimal realizations for a given fuzzy multiset language are isomorphic to it.

show abstract

“…e recent contribution to the study of fuzzy multiset automata and fuzzy multiset languages is due to Sharma et al [76,77], Wang and Li [64], Pal and Tiwari [78], and Tiwari et al [79].…”

Section: Introductionmentioning

confidence: 99%

A General Categorical Framework of Minimal Realization Theory for a Fuzzy Multiset Language

Yadav

Tiwari

2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Previously, Blanco et al [3] discussed fuzzy knowledge equivalence representations between neural networks, fuzzy systems and models of automata. Sharma et al [17] studied the concepts of homomorphism, fuzzy multiset transformation semigroup and coverings of fuzzy multiset finite automata, and established their basic properties for the algebraic study of fuzzy multiset automata theory. From a control point of view, fuzzy finite-state automata (FFA) with recurrent neural networks [11] for often imitating fuzzy dynamical systems were very useful.…”

Section: Introductionmentioning

confidence: 99%

Application of Fuzzy Pushdown Automaton on Prediction of Quality Control for Spinning Yarn

Wang

Chen

et al. 2021

ITC

View full text Add to dashboard Cite

In order to perform better recognition, tracking and control for fuzzy and uncertain thing, this paper will design a suitable fuzzy pushdown automaton (FPDA) control method to solve the problem. Firstly, the control design structure of FPDA and the decision reasoning rules in control are given. Secondly, the application of FPDA in prediction of quality control for spinning yarn is discussed in the practical problem. Finally, the comparison of FPDA and other control methods on the target control is given. The simulation results show that the control speed and the average precision of designed FPDA are faster by12ms and higher by 4.98% than that of traditional method, which its control precision is 96.87%.

show abstract

“…More recently, Wang et al [26] employed fuzzy information to multiset finite automata and multiset grammars. Tiwari and Sharma et al discussed minimization problem of fuzzy multiset automata in [21,24] and the algebraic properties of fuzzy multiset finite automata, respectively. In fact, as Ciobanu and Gontineac [5] puts it, "multiset automata become very powerful."…”

Section: Introductionmentioning

confidence: 99%

Algebraic properties of intuitionistic $$L-$$fuzzy multiset finite automata

Wang

Li-xia

2021

Soft Comput

View full text Add to dashboard Cite

Algrbraic properties and structures of intuitionistic L−fuzzy multiset finite automata (ILFMA) are discussed through congruences on a semigroup in this paper. Firstly, we put forward the notion of the intuitionistic L−fuzzy compatible relation, the compatible monoid associated to the intuitionistic L−fuzzy compatible relation can be effectively constructed, and we construct two finite monoids through two different congruence relations on a given ILFMA, then we also prove that they are isomorphic. Furthermore, using the quotient structure of ILFMA, algebraic properties of intuitionistic L−fuzzy multiset transformation semigroup are discussed. According to intuitionistic L−admissible relation and homomorphism of ILFMA, we show that there is a bijective correspondence between an ILFMA and the quotient structure of another ILFMA.

show abstract

On Algebraic Study of Fuzzy Multiset Finite Automata

Cited by 14 publications

References 16 publications

A General Categorical Framework of Minimal Realization Theory for a Fuzzy Multiset Language

A General Categorical Framework of Minimal Realization Theory for a Fuzzy Multiset Language

Application of Fuzzy Pushdown Automaton on Prediction of Quality Control for Spinning Yarn

Algebraic properties of intuitionistic $$L-$$fuzzy multiset finite automata

Contact Info

Product

Resources

About