Generalized rough and fuzzy rough automata for semantic computing

Yadav, Swati; Tiwari, S. P.; Kumari, Mausam; Yadav, Vijay K.

doi:10.1007/s13042-022-01637-0

Cited by 4 publications

(2 citation statements)

References 63 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Pal et al introduced L-fuzzy rough automata and L-fuzzy rough language corresponding to an L-fuzzy automaton, investigating the relationship between definite/possible L-fuzzy languages accepted by L-fuzzy rough automata [7]. Yadav et al presented generalized rough finite-state automata and fuzzy finite rough automata for semantic computing (SC) capable of accepting semantically equivalent incomplete, vague, and insufficient input information from real-world applications [16]. In [6], Kierczak defined the notions of best lower and upper approximations of grammar, along with properties of languages generated by these approximations.…”

Section: Introductionmentioning

confidence: 99%

Rough Pushdown Automata and Rough Context Free Grammar

Singh

2024

Preprint

View full text Add to dashboard Cite

This paper proposes a new computational model, Rough Pushdown Automata (R-PDA), which extends the capabilities of traditional Pushdown Automata by incorporating Rough Set Theory. The proposed R-PDA is designed to handle imprecise and uncertain data, making it effective for decision-making under uncertain conditions. Alongside the R-PDA we further develop rough context free grammar (R-CFG) and rough context free language (R-CFL), and show its equivalence to R-PDA, i.e. for every R-PDA there is an R-CFL and vice versa. Some closure properties of R-CFL are developed to demonstrate the mathematical efficacy of the proposed model. The research provides insights into the use of rough set theory in automata theory and its potential in solving real-world problems. In this era of technological advancement coping with uncertainty is more crucial than ever. Medical domain is no exception. Efficacy of the proposed R-PDA model is demonstrated through a case study of Asthma disease, one of the most common chronic diseases in the world. Although Rough FSA has already been proposed in literature, the concept of R-PDA appears to be novel. Moreover, application of Automata theory is rarely discussed in healthcare system. The proposed model helps in bridging the gap in an effective way.

show abstract

Section: Introductionmentioning

confidence: 99%

Rough Pushdown Automata and Rough Context Free Grammar

Singh

2024

Preprint

View full text Add to dashboard Cite

show abstract

“…The algebraic views of FFSA have been studied by Mordeson and Malik [19,20] and Jin [21] whereas lattice theoretic aspects of FFSA have been studied in Tiwari, Yadav, and Singh [22]. The computational model rough finite state automaton was introduced by Basu [23] to model systems with insufficient and incomplete data set obtained by real-world applications and is further generalized by Yadav, Tiwari, Mausam and Yadav [24] and shown to have real-world application of model.…”

Section: Introductionmentioning

confidence: 99%

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