We study three notions of directability of fuzzy automata akin to the D1-, D2and D3-directability of nondeterministic automata. Thus an input word w of a fuzzy automaton is D1-directing if a fixed single state is reachable by w from all states, D2-directing if exactly the same states are reachable by w from every state, and D3-directing if there is a state reachable by w from every state. We st...

the purpose of the present work is to introduce the concept of bifuzzy core of a fuzzy automaton, which induces a bifuzzy topology on the state-set of this fuzzy automaton. this is shown that this bifuzzy topology can be used to characterize the concepts such as bifuzzy family of submachines, bifuzzy separable family and bifuzzy retrievable family of a fuzzy automaton.

We study the reachability problem for continuous one-counter automata, COCA short. In such transitions are guarded by upper- and lower-bound tests against counter value. Additionally, updates associated with taking can be (non-deterministically) scaled down a nonzero factor between zero one. Our three main results as follows: we prove (1) that global is in NC 2 ; (2) that, general, decidable po...

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, ...

The theories of metric spaces and fuzzy are crucial topics in mathematics. 
 Compactness is one the most important fundamental properties that have been widely used Functional Analysis. In this paper, definition compact soft space introduced some its theorems investigated. Also, sequentially locally defined relationships between them studied. Moreover, each previous two concepts several ot...

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...