Swati Yadav
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Swati Yadav has a total of 7 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
3 shared publications - Vijay Kumar Yadav
Department of Mathematics, Central University of Rajasthan, Ajmer, India
3 shared publications - Binod Kumar Sharma
Department of Computer Science and Engineering, Birla Institute of Technology, Mesra, Ranchi, India
1 shared publication - Mausam Kumari
Department of Mathematics, Central University of Rajasthan, NH-8 Bandarsindari, Ajmer 305817, Rajasthan, India
1 shared publication - Shainky Ruhela
Department of Mathematics, Central University of Rajasthan, NH-8 Bandarsindari, Ajmer 305817, Rajasthan, India
1 shared publication - Sunny Verma
Department of Mathematics, Central University of Rajasthan, NH-8 Bandarsindari, Ajmer 305817, Rajasthan, India
1 shared publication
Latest Publications
- 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.
- Open Access
- 30 July 2022
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2022, 1-19
A General Categorical Framework of Minimal Realization Theory for a Fuzzy Multiset Language
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.
- 30 July 2022
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2022, 1-19
Open AccessA General Categorical Framework of Minimal Realization Theory for a Fuzzy Multiset Language
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.
- 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.