Binod Kumar Sharma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Binod Kumar Sharma has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Apostolos Syropoulos
Greek Molecular Computing Group, 67133 Xanthi, Greece
4 shared publications - Vijay Kumar Yadav
Department of Mathematics, Central University of Rajasthan, Ajmer, India
3 shared publications - Shainky Ruhela
Department of Mathematics, Central University of Rajasthan, NH-8 Bandarsindari, Ajmer 305817, Rajasthan, India
2 shared publications Apostolos Syropoulos
1 shared publication- Basil Papadopoulos
Section of Mathematics, Programming and General Courses, Department of Civil Engineering, School of Engineering, Democritus University of Thrace, 67100 Xanthi, Greece
1 shared publication Keshav Sinha
1 shared publication
Latest Publications
- 17 November 2026
- Published by Winaya Inspirasi Nusantara Foundation in Journal of Analytical Uncertainty
- Vol. 2 (1) , 90-98
DFA Minimization of Fuzzy Multiset Automata
Deterministic finite automaton (DFA) minimization is the process of converting a DFA into an equivalent DFA with a minimum number of states. Here we apply on such process (i.e., Brzozowski’s algorithm) to crisp deterministic fuzzy multiset finite automata. We introduce reverse fuzzy multiset finite automata and establish a relation between their right and left fuzzy multiset languages. In between, we correlate two crisp-deterministic fuzzy multiset finite automata and show that the reachability and observability map of the given crisp deterministic fuzzy multiset finite automata to be isomorphic.
- 17 November 2026
- Published by Winaya Inspirasi Nusantara Foundation in Journal of Analytical Uncertainty
- Vol. 2 (1) , 90-98
DFA Minimization of Fuzzy Multiset Automata
Deterministic finite automaton (DFA) minimization is the process of converting a DFA into an equivalent DFA with a minimum number of states. Here we apply on such process (i.e., Brzozowski’s algorithm) to crisp deterministic fuzzy multiset finite automata. We introduce reverse fuzzy multiset finite automata and establish a relation between their right and left fuzzy multiset languages. In between, we correlate two crisp-deterministic fuzzy multiset finite automata and show that the reachability and observability map of the given crisp deterministic fuzzy multiset finite automata to be isomorphic.
- 24 April 2026
- Published by Winaya Inspirasi Nusantara Foundation in Journal of Analytical Uncertainty
- Vol. 1 (2) , 1-5
Erdős–Rényi Models and Neutrosophic Sets
Networks comprise a vast array of diverse entities, including organizations, computers, airports, and more. The elements are interconnected either physically (e.g., through cables or microwaves) or mentally, when they pertain to ideas or concepts. In the broadest context, the linkages exhibit no discernible pattern. Graphs are mathematical constructs utilized to represent networks and analyze their characteristics. A random graph is one in which a stochastic process dictates the existence of an edge between two vertices. An Erdős–Rényi model is a framework for generating random graphs or examining the evolution of a random graph. Substituting likelihood with plausibility results in a fundamentally distinct framework that can be mathematically characterized using fuzzy graphs. In addition, we gain far more flexibility by adding a measure of the opposite of plausibility and a measure of indeterminacy. This naturally leads to a reinterpretation of established concepts and ideas and the framework of neutrosophic set theory.
- 24 April 2026
- Published by Winaya Inspirasi Nusantara Foundation in Journal of Analytical Uncertainty
- Vol. 1 (2) , 1-5
Erdős–Rényi Models and Neutrosophic Sets
Networks comprise a vast array of diverse entities, including organizations, computers, airports, and more. The elements are interconnected either physically (e.g., through cables or microwaves) or mentally, when they pertain to ideas or concepts. In the broadest context, the linkages exhibit no discernible pattern. Graphs are mathematical constructs utilized to represent networks and analyze their characteristics. A random graph is one in which a stochastic process dictates the existence of an edge between two vertices. An Erdős–Rényi model is a framework for generating random graphs or examining the evolution of a random graph. Substituting likelihood with plausibility results in a fundamentally distinct framework that can be mathematically characterized using fuzzy graphs. In addition, we gain far more flexibility by adding a measure of the opposite of plausibility and a measure of indeterminacy. This naturally leads to a reinterpretation of established concepts and ideas and the framework of neutrosophic set theory.
- 31 March 2025
- Published by Springer Nature
- p. 383-402
Neutrosophic Sets and the Production and Distribution of Electricity
- 31 March 2025
- Published by Springer Nature
- p. 383-402
Neutrosophic Sets and the Production and Distribution of Electricity
- 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.
- 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.