anti-lock braking system (abs) is a nonlinear and time varying system including uncertainty, so it cannot be controlled by classic methods. intelligent methods such as fuzzy controller are used in this area extensively; however traditional fuzzy controller using simple type-1 fuzzy sets may not be robust enough to overcome uncertainties. for this reason an interval type-2 fuzzy controller is de...

This paper introduces Fuzzy State Automata for control applications. They are derived from the integration of traditional nite state automata and neuro-fuzzy systems, where a nite state automaton tracks the state of the plant under control and modiies the characteristic of the neuro-fuzzy system accordingly. The main diierence with respect to existing systems is that the states of the automata ...

Fuzzy Finite Tree Automata (FFTA) are natural generalizations of fuzzy automata on words. FFTA accept fuzzy tree languages and are used in many areas of mathematics, computer science and engineering. Therefore, it is important to design algorithms that reduce the size (number of states) of automata, and find the minimal FFTA that recognizes the same language as a given FFTA. We present two mini...

Abstract Fuzzy multiset finite automata with output represent fuzzy version of (with output) working over multisets. This paper introduces Mealy-like, Moore-like, and compact automata. Their mutual transformations are described to prove their equivalent behaviours. Furthermore, various variants reduced studied where the reductions directed decrease number components (like initial distribution, ...

In this paper, our focus of attention is the proper propagationof fuzzy degrees in determinization of $Nondeterministic$ $Fuzzy$$Finite$ $Tree$ $Automata$ (NFFTA). Initially, two determinizationmethods are introduced which have some limitations (one inbehavior preserving and other in type of fuzzy operations). Inorder to eliminate these limitations and increasing theefficiency of FFTA, we defin...

In this paper intuitionistic fuzzy pushdown automata, acceptance by empty stack and acceptance by final states and their equivalence is proved. It follows that intuitionistic fuzzy pushdown automata with empty stack and IFPDAs are equivalent. We propose the notions of intuitionistic fuzzy context-free grammars (IFCFGs), intuitionistic fuzzy languages generated by IFCFGs. Additionally, we introd...

Finite state automata are crucial for numerous practical algorithms of computer science. We show how to use genetic algorithms and fuzzy automata to simplify a class of FSA defined by labeled graphs and considered in the literature. Finite state automata, FSA, are well-known tools used in coding theory, text processing, image analysis and compression, speech recognition, and bioinformatics. Lab...