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

In this note, we define bisimulation for BL-general fuzzy automata and show that if there is a bisimulation between two BL-general fuzzy automata, then they have the same behavior.For a given BL-general fuzzy automata, we obtain the greatest bisimulation for the BL-general fuzzy automata. Thereafter, if we use the greatest bisimulation, then we obtain a quotient BL-general fuzzy automata and th...

A model for finite automaton with an open quantum evolution is introduced, and its basic properties are studied. It is shown that the (fuzzy) languages accepted by open evolution quantum automata obey various closure properties. More importantly, it is shown that major other models of finite automata, including probabilistic, measure once quantum, measure many quantum, and Latvian quantum autom...

Automata are the prime example of general computational systems over discrete spaces. The incorporation of fuzzy logic into automata theory resulted in fuzzy auotomata which can handle continuous spaces. Moreover, they are able to model uncertainty which is inherent in many applications. Deterministic Finite-state Automata (DFA) have been the architecture, most used in many applications, but, t...

Chaudhari S. R. ,Komejwar D. D. , On Fuzzy Pushdown Automata and their covering , International Journal of Computer Applications Vol. 46(8),2012 pp 27-33 Comon H. ,Dauchet M. ,Gilleron R. ,Jacquemard F. , Lugiez D. ,Loding C. ,Tison S. , and Tommasi M. , Tree Automata: techniques and apllications. (2007) Lee E. T. Fuzzy tree automata and syntactic pattern recognition, IEEE Trans Pattern Anal Ma...

Automata-based methods have been successfully employed to prove tight complexity bounds for reasoning in many classical logics, and in particular in Description Logics (DLs). Very recently, the ideas behind these automata-based approaches were adapted for reasoning also in fuzzy extensions of DLs, with semantics based either on finitely many truth degrees or the Gödel t-norm over the interval [...

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