Abstract — In this paper an attempt has been made to study fuzzy mathematical machines in a systematic manner. Results of fuzzy finite-state machines which are natural generalisation of respective concepts of ordinary mathematical machines have been reported. The concept of fuzzy finite-state machines with output actually leads to a natural definition of a fuzzy finite-state automaton — a generalisation of ordinary finite-state automaton. A realistic version of the concept of fuzzy mathematical machine is introduced in which the state, the input, the output as well as the state transition function are all fuzzy concepts. This definition actually leads us to realize a fuzzy mathematical machine as a fuzzy system. Copyright c © 2008 Yang’s Sc...
The York fuzzy automata machine (FAMe) is a massively parallel fuzzy cellular automata machine, capa...
Abstract—This paper presents a reconfigurable state transition architecture for the Hybrid Fuzzy-Boo...
AbstractIn this paper, we show: The threshold of fuzzy automata can be changed arbitrarily. The fuzz...
The constructions of finite switchboard state automata are known to be an extension of finite automa...
The subject of the present paper is the study of fuzzy computability based on fuzzy Turing machines....
AbstractAutomata are the prime example of general computational systems over discrete spaces. The in...
To handle fuzzy uncertainty in system modeling, nondeterministic finite automata have been generaliz...
Abstract—There has been a long history of using fuzzy lan-guage equivalence to compare the behavior ...
Fuzzy multiset finite automata represent fuzzy version of finite automata working over multisets. De...
The paper deals with a simplified form of jumping fuzzy general finite automata where transition fun...
Abstract. In this paper, relations among the membership values of gener-alized fuzzy languages such ...
Classical automata theory cannot deal with the system uncertainty. To deal with the system uncertain...
A finite switchboard state machine is a specialized finite state machine. It is built by binding the...
The concept of fuzzy multiset finite automata was introduced recently by Wang et al. in [14]. The id...
There has been a long history of using fuzzy-language equivalence to compare the behavior of fuzzy s...
The York fuzzy automata machine (FAMe) is a massively parallel fuzzy cellular automata machine, capa...
Abstract—This paper presents a reconfigurable state transition architecture for the Hybrid Fuzzy-Boo...
AbstractIn this paper, we show: The threshold of fuzzy automata can be changed arbitrarily. The fuzz...
The constructions of finite switchboard state automata are known to be an extension of finite automa...
The subject of the present paper is the study of fuzzy computability based on fuzzy Turing machines....
AbstractAutomata are the prime example of general computational systems over discrete spaces. The in...
To handle fuzzy uncertainty in system modeling, nondeterministic finite automata have been generaliz...
Abstract—There has been a long history of using fuzzy lan-guage equivalence to compare the behavior ...
Fuzzy multiset finite automata represent fuzzy version of finite automata working over multisets. De...
The paper deals with a simplified form of jumping fuzzy general finite automata where transition fun...
Abstract. In this paper, relations among the membership values of gener-alized fuzzy languages such ...
Classical automata theory cannot deal with the system uncertainty. To deal with the system uncertain...
A finite switchboard state machine is a specialized finite state machine. It is built by binding the...
The concept of fuzzy multiset finite automata was introduced recently by Wang et al. in [14]. The id...
There has been a long history of using fuzzy-language equivalence to compare the behavior of fuzzy s...
The York fuzzy automata machine (FAMe) is a massively parallel fuzzy cellular automata machine, capa...
Abstract—This paper presents a reconfigurable state transition architecture for the Hybrid Fuzzy-Boo...
AbstractIn this paper, we show: The threshold of fuzzy automata can be changed arbitrarily. The fuzz...