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

This paper focuses on the issue of how generalizations of continuous and leftcontinuous t-norms over linearly ordered sets should be from a logical point of view. Taking into account recent results in the scope of algebraic semantics for fuzzy logics over chains with a monoidal residuated operation, we advocate linearly ordered BL-algebras and MTL-algebras as adequate generalizations of continu...

the main goal of the present study was to implement a hybrid pattern of cellular automata model and particle swarm optimization algorithm based on tm and etm+ imagery of landsat satellite from 1988 to 2010 for simulating the urban sprawling. in this study, an alternative model was implemented in two ways: the first method was based on two images (1988 and 2010) and the second one was based on t...

The main goal of the present study was to implement a hybrid pattern of cellular automata model and particle swarm optimization algorithm based on TM and ETM+ imagery of landsat satellite from 1988 to 2010 for simulating the urban sprawling. In this study, an alternative model was implemented in two ways: the first method was based on two images (1988 and 2010) and the second one was based on t...

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

we present some model theoretic results for {l}ukasiewiczpredicate logic by using the methods of continuous model theorydeveloped by chang and keisler.we prove compactness theorem with respect to the class of allstructures taking values in the {l}ukasiewicz $texttt{bl}$-algebra.we also prove some appropriate preservation theorems concerning universal and inductive theories.finally, skolemizatio...