Using fuzzy automata to diagnose and predict heart problems

Camacho, Azahara; Merayo, Mercedes G.; Núñez, Manuel

doi:10.1109/cec.2017.7969397

Cited by 3 publications

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The minimal realization problem of fuzzy languages has been studied algebraically in [21], by category-theoretic approach in [50,53,55], and in bicategory theoretic setting in [52,54,63] to brings closer the gap between classical automata theory and natural languages. The fuzzy automata and languages have been shown helpful in many applications like supervisory control [43], learning systems [60], heart problem deduction [8]. Both finite automata [19] and fuzzy finite automata [9,21] are the formal model of computation with values and therefore have limited applications.…”

Section: Introductionmentioning

confidence: 99%

Generalized rough and fuzzy rough automata for semantic computing

Yadav

Tiwari

Kumari

et al. 2022

Int. J. Mach. Learn. & Cyber.

View full text Add to dashboard Cite

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.

show abstract