Add to ORKGClassical automata theory cannot deal with the system uncertainty. To deal with the system uncertainty the concept of fuzzy finite automata was proposed. Fuzzy automata can be used in diverse applications such as fault detection, pattern matching, measuring the fuzziness between strings, description of natural languages, neural network, lexical analysis, image processing, scheduling problem and many more. In this paper, a methodical literature review is carried out on various research works in the field of Fuzzy automata and explained the challenging issues in the field of fuzzy automata
Determinization algorithms are methods that calculate complete deterministic fuzzy (weighted) autom...
Classical automata theory can not deal with uncertainty. To deal with uncertainty in system modeling...
Abstract — In this paper an attempt has been made to study fuzzy mathematical machines in a systemat...
AbstractIn this paper, we show: The threshold of fuzzy automata can be changed arbitrarily. The fuzz...
AbstractAutomata are the prime example of general computational systems over discrete spaces. The in...
In this paper we provide a general definition of automata with fuzzy stateswhich includes as its spe...
To handle fuzzy uncertainty in system modeling, nondeterministic finite automata have been generaliz...
This bibliography contains references to papers on fuzzy formal languages, the generation of fuzzy l...
In this paper, a method has been presented to convert finite automaton to fuzzy automaton as fuzzy a...
AbstractIn previous work we have shown that nondeterministic fuzzy finite automata (or NFFAs, for sh...
A notion of finite ! - automata with single initial state is proposed. The concept of fuzzy determi...
Automata theory based on complete residuated lattice-valued logic has been initiated by Qiu, and fur...
The determinization of fuzzy automata is a well-studied problem in theoretical computer science cele...
The concept of fuzzy multiset finite automata was introduced recently by Wang et al. in [14]. The id...
Abstract-In this study, we introduce the concept of lattice-valued regular expressions. Such express...
Determinization algorithms are methods that calculate complete deterministic fuzzy (weighted) autom...
Classical automata theory can not deal with uncertainty. To deal with uncertainty in system modeling...
Abstract — In this paper an attempt has been made to study fuzzy mathematical machines in a systemat...
AbstractIn this paper, we show: The threshold of fuzzy automata can be changed arbitrarily. The fuzz...
AbstractAutomata are the prime example of general computational systems over discrete spaces. The in...
In this paper we provide a general definition of automata with fuzzy stateswhich includes as its spe...
To handle fuzzy uncertainty in system modeling, nondeterministic finite automata have been generaliz...
This bibliography contains references to papers on fuzzy formal languages, the generation of fuzzy l...
In this paper, a method has been presented to convert finite automaton to fuzzy automaton as fuzzy a...
AbstractIn previous work we have shown that nondeterministic fuzzy finite automata (or NFFAs, for sh...
A notion of finite ! - automata with single initial state is proposed. The concept of fuzzy determi...
Automata theory based on complete residuated lattice-valued logic has been initiated by Qiu, and fur...
The determinization of fuzzy automata is a well-studied problem in theoretical computer science cele...
The concept of fuzzy multiset finite automata was introduced recently by Wang et al. in [14]. The id...
Abstract-In this study, we introduce the concept of lattice-valued regular expressions. Such express...
Determinization algorithms are methods that calculate complete deterministic fuzzy (weighted) autom...
Classical automata theory can not deal with uncertainty. To deal with uncertainty in system modeling...
Abstract — In this paper an attempt has been made to study fuzzy mathematical machines in a systemat...