Abstract
This paper shows a definition of a fuzzy automaton, which has the state, input, and output sets as fuzzy sets. The state transition function is defined as moving on a fuzzy relief with fuzzy peak-states and boundaries between different membership functions. After the definition of fuzzy automaton with fuzzy relief, the paper deals with a generalization, simulation and realization of such a fuzzy automaton. The paper links the defined fuzzy automaton to an existing fuzzy JK memory cell and to well-known fuzzy automata defined on the basis of crisp sets.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
