Vijay Kumar Yadav
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Vijay Kumar Yadav has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- S. P. Tiwari
Department of Mathematics & Computing, Indian Institute of Technology (ISM), Dhanbad 826004, India
10 shared publications - Shainky Ruhela
Department of Mathematics, Central University of Rajasthan, NH-8 Bandarsindari, Ajmer 305817, Rajasthan, India
5 shared publications - Binod Kumar Sharma
Department of Computer Science and Engineering, Birla Institute of Technology, Mesra, Ranchi, India
3 shared publications - Mausam Kumari
Department of Mathematics, Central University of Rajasthan, NH-8 Bandarsindari, Ajmer 305817, Rajasthan, India
3 shared publications - Sunny Verma
Department of Mathematics, Central University of Rajasthan, NH-8 Bandarsindari, Ajmer 305817, Rajasthan, India
3 shared publications - Swati Yadav
Department of Mathematics and Computing, Indian Institute of Technology (Indian School of Mines), Dhanbad, India
3 shared publications
Latest Publications
- 11 December 2024
- Published by World Scientific Pub Co Pte Ltd in New Mathematics and Natural Computation
- Vol. 22 (02) , 593-628
On Characterization of Algebraic Structure of Fuzzy Multiset Finite Automata
This paper enriches the theory of computing in the context of fuzzy sets and multisets. We have studied the computational model fuzzy multiset finite automaton (FMFA), which incorporates uncertainty about the next state of transition and multiple occurrences in the input set of automaton, and can be viewed as a generalized version of both classical automaton and fuzzy automaton. We have discussed the algebraic characterization of subautomaton of a FMFA, separatedness, strong connectedness and cyclic, directable and triangular FMFA in terms of equivalence classes induced by an equivalence relation defined on the state set of FMFA. Interestingly, for a given FMFA, a new FMFA is constructed which is a homomorphic image of the original FMFA. We have defined different poset structures associated with a given FMFA and showed that some of them are upper semilattices and discussed the inter-relationship of a given poset, a finite upper semilattice (FUSL), a FMFA and a poset/FUSL associated with a given FMFA. Finally, we have introduced the concept of decomposition of a FMFA in two different ways and characterized the strongly connected, triangular and directable FMFA.
- 11 December 2024
- Published by World Scientific Pub Co Pte Ltd in New Mathematics and Natural Computation
- Vol. 22 (02) , 593-628
On Characterization of Algebraic Structure of Fuzzy Multiset Finite Automata
This paper enriches the theory of computing in the context of fuzzy sets and multisets. We have studied the computational model fuzzy multiset finite automaton (FMFA), which incorporates uncertainty about the next state of transition and multiple occurrences in the input set of automaton, and can be viewed as a generalized version of both classical automaton and fuzzy automaton. We have discussed the algebraic characterization of subautomaton of a FMFA, separatedness, strong connectedness and cyclic, directable and triangular FMFA in terms of equivalence classes induced by an equivalence relation defined on the state set of FMFA. Interestingly, for a given FMFA, a new FMFA is constructed which is a homomorphic image of the original FMFA. We have defined different poset structures associated with a given FMFA and showed that some of them are upper semilattices and discussed the inter-relationship of a given poset, a finite upper semilattice (FUSL), a FMFA and a poset/FUSL associated with a given FMFA. Finally, we have introduced the concept of decomposition of a FMFA in two different ways and characterized the strongly connected, triangular and directable FMFA.
- 23 August 2024
- Published by World Scientific Pub Co Pte Ltd in New Mathematics and Natural Computation
- Vol. 21 (03) , 839-865
Topological Approaches in Characterization of Algebraic Structure of Fuzzy Multiset Finite Automata
This paper aims to provide the topological approaches in the characterization of the algebraic structure of fuzzy multiset finite automaton (FMFA). We have shown how the topological concepts of open sets and continuous functions can be utilized to characterize the algebraic structure of FMFA. The topological definition of a continuous function on fuzzy multiset finite automata and its structure preserving qualities are investigated. The operation preserving function between two fuzzy multiset finite automata is introduced, such functions are analogous to a homomorphism between algebraic structures but have an even stronger structure preserving nature than the continuous functions.
- 23 August 2024
- Published by World Scientific Pub Co Pte Ltd in New Mathematics and Natural Computation
- Vol. 21 (03) , 839-865
Topological Approaches in Characterization of Algebraic Structure of Fuzzy Multiset Finite Automata
This paper aims to provide the topological approaches in the characterization of the algebraic structure of fuzzy multiset finite automaton (FMFA). We have shown how the topological concepts of open sets and continuous functions can be utilized to characterize the algebraic structure of FMFA. The topological definition of a continuous function on fuzzy multiset finite automata and its structure preserving qualities are investigated. The operation preserving function between two fuzzy multiset finite automata is introduced, such functions are analogous to a homomorphism between algebraic structures but have an even stronger structure preserving nature than the continuous functions.
- 23 August 2024
- Published by World Scientific Pub Co Pte Ltd in New Mathematics and Natural Computation
- Vol. 21 (03) , 1077-1106
Weighted Hesitant Fuzzy Finite Rough Automaton: A Computing Model for Natural Language Processing
The well-known computing models, classical/fuzzy/rough automata, in spite of their multifarious applications, fail to model those complex real-world systems that contain both vagueness and incomplete information in datasets of real-world complex systems. The computing model, [ ]-fuzzy rough automata, incorporates both vagueness and incomplete information in datasets of such systems but fails to incorporate the weights of fuzzy attributes. To overcome this issue, we first introduce the concept weighted hesitant fuzzy finite automaton (WHFFA), as a generalized notion of the hesitant [ ]-fuzzy automaton (HLFA), where weights show that the decision maker has distinct confidence in providing the possible valuation of the membership degree. We used the concept of weighted hesitant fuzzy rough set (WHFRS) as a hybrid concept of hesitant fuzzy rough set (HFRS) and weighted hesitant fuzzy set (WHFS) to introduce a novel computing model weighted hesitant fuzzy finite rough automaton (WHFFRA). The introduced WHFFRA is efficient for dealing with vagueness and incomplete information inherent in our natural languages and in datasets of the real-world complex systems. Finally, we discuss determinization of WHFFRA and demonstrated the application of introduced WHFFRA in decision-making scenarios of medical diagnosis problems.
- 23 August 2024
- Published by World Scientific Pub Co Pte Ltd in New Mathematics and Natural Computation
- Vol. 21 (03) , 1077-1106
Weighted Hesitant Fuzzy Finite Rough Automaton: A Computing Model for Natural Language Processing
The well-known computing models, classical/fuzzy/rough automata, in spite of their multifarious applications, fail to model those complex real-world systems that contain both vagueness and incomplete information in datasets of real-world complex systems. The computing model, [ ]-fuzzy rough automata, incorporates both vagueness and incomplete information in datasets of such systems but fails to incorporate the weights of fuzzy attributes. To overcome this issue, we first introduce the concept weighted hesitant fuzzy finite automaton (WHFFA), as a generalized notion of the hesitant [ ]-fuzzy automaton (HLFA), where weights show that the decision maker has distinct confidence in providing the possible valuation of the membership degree. We used the concept of weighted hesitant fuzzy rough set (WHFRS) as a hybrid concept of hesitant fuzzy rough set (HFRS) and weighted hesitant fuzzy set (WHFS) to introduce a novel computing model weighted hesitant fuzzy finite rough automaton (WHFFRA). The introduced WHFFRA is efficient for dealing with vagueness and incomplete information inherent in our natural languages and in datasets of the real-world complex systems. Finally, we discuss determinization of WHFFRA and demonstrated the application of introduced WHFFRA in decision-making scenarios of medical diagnosis problems.
- 5 August 2024
- Published by Springer Nature in Soft Computing
- Vol. 28 (17-18) , 9233-9252
On categories associated with crisp deterministic automata with fuzzy rough outputs and fuzzy rough languages
- 5 August 2024
- Published by Springer Nature in Soft Computing
- Vol. 28 (17-18) , 9233-9252
On categories associated with crisp deterministic automata with fuzzy rough outputs and fuzzy rough languages
- Open Access
- 16 August 2023
- Published by MDPI AG in Preprints.org
Fuzzy Multiset Finite Automata: Some Algebraic and Lattice Theoretic Characterizations
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.
- 16 August 2023
- Published by MDPI AG in Preprints.org
Open AccessFuzzy Multiset Finite Automata: Some Algebraic and Lattice Theoretic Characterizations
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.
- 21 September 2022
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 13 (12) , 4013-4032
Generalized rough and fuzzy rough automata for semantic computing
The classical automata, fuzzy finite automata, and rough finite state automata are some formal models of computing used to perform the task of computation and are considered to be the input device. These computational models are valid only for fixed input alphabets for which they are defined and, therefore, are less user-friendly and have limited applications. The semantic computing techniques provide a way to redefine them to improve their scope and applicability. In this paper, the concept of semantically equivalent concepts and semantically related concepts in information about real-world applications datasets are used to introduce and study two new formal models of computations with semantic computing (SC), namely, a rough finite-state automaton for SC and a fuzzy finite rough automaton for SC as extensions of rough finite-state automaton and fuzzy finite-state automaton, respectively, in two different ways. The traditional rough finite-state automata can not deal with situations when external alphabet or semantically equivalent concepts are given as inputs. The proposed rough finite-state automaton for SC can handle such situations and accept such inputs and is shown to have successful real-world applications. Similarly, a fuzzy finite rough automaton corresponding to a fuzzy automaton is also failed to process input alphabet different from their input alphabet, the proposed fuzzy finite rough automaton for SC corresponding to a given fuzzy finite automaton is capable of processing semantically related input, and external input alphabet information from the dataset obtained by real-world applications and provide better user experience and applicability as compared to classical fuzzy finite rough automaton.
- 21 September 2022
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 13 (12) , 4013-4032
Generalized rough and fuzzy rough automata for semantic computing
The classical automata, fuzzy finite automata, and rough finite state automata are some formal models of computing used to perform the task of computation and are considered to be the input device. These computational models are valid only for fixed input alphabets for which they are defined and, therefore, are less user-friendly and have limited applications. The semantic computing techniques provide a way to redefine them to improve their scope and applicability. In this paper, the concept of semantically equivalent concepts and semantically related concepts in information about real-world applications datasets are used to introduce and study two new formal models of computations with semantic computing (SC), namely, a rough finite-state automaton for SC and a fuzzy finite rough automaton for SC as extensions of rough finite-state automaton and fuzzy finite-state automaton, respectively, in two different ways. The traditional rough finite-state automata can not deal with situations when external alphabet or semantically equivalent concepts are given as inputs. The proposed rough finite-state automaton for SC can handle such situations and accept such inputs and is shown to have successful real-world applications. Similarly, a fuzzy finite rough automaton corresponding to a fuzzy automaton is also failed to process input alphabet different from their input alphabet, the proposed fuzzy finite rough automaton for SC corresponding to a given fuzzy finite automaton is capable of processing semantically related input, and external input alphabet information from the dataset obtained by real-world applications and provide better user experience and applicability as compared to classical fuzzy finite rough automaton.
- 18 March 2022
- Published by World Scientific Pub Co Pte Ltd in New Mathematics and Natural Computation
- Vol. 19 (01) , 153-172
On Minimal Realization of ILF-Languages: A Categorical Approach
This work is toward application of categorical concept to produce a minimal ILF-automaton for a given ILF-language. The ILF-equivalence relation over free monoid formed by a nonempty set together with categorical concepts is used for such construction.
- 18 March 2022
- Published by World Scientific Pub Co Pte Ltd in New Mathematics and Natural Computation
- Vol. 19 (01) , 153-172
On Minimal Realization of ILF-Languages: A Categorical Approach
This work is toward application of categorical concept to produce a minimal ILF-automaton for a given ILF-language. The ILF-equivalence relation over free monoid formed by a nonempty set together with categorical concepts is used for such construction.
- 14 April 2018
- Published by Springer Nature
- p. 268-277
On the Relationship Between L-fuzzy Closure Spaces and L-fuzzy Rough Sets
- 14 April 2018
- Published by Springer Nature
- p. 268-277
On the Relationship Between L-fuzzy Closure Spaces and L-fuzzy Rough Sets