- Full text PDF available (4)
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… (More)
This paper deals with the concept of complete residuated lattice-valued (referred to as L-valued) finite tree automata. In this regard, we first define an L-valued regular tree language, and then we prove a necessary and sufficient condition for the regularity of an L-valued tree language. Furthermore, we generalize the pumping lemma for L-valued finite… (More)
Recently, an emphasis has been placed on the content based Information Retrieval Systems (IRS). Finding documents based on content similarity using background knowledge is becoming an increasingly important task. This paper aims for two main tasks in order to high quality document retrieval; first, we present our formulation of fuzzy ontology and then, by… (More)
In this paper, we consider the general fuzzy automata based on complete residuated lattice-valued (L-GFAs). We mainly discuss the relationship between the category of L-GFAs and the category of non-deterministic automata (NDAs). Specially, we show that instead of a general fuzzy automaton we can deal equivalently with a chain of non-deterministic automata.… (More)
Until now, some methods for minimizing deterministic fuzzy finite tree automata (DFFTA) and weighted tree automata have been established by researchers. Those methods are language preserving, but the behavior of original automata and minimized one may be different. This paper, considers both language preserving and behavior preserving in minimization… (More)
In this note, by considering the notions of intuitionistic general L-fuzzy automata based on lattice valued intuitionistic fuzzy sets and (α, β)-language, we prove that for any (α,β)-language L, there exists a minimal IGLFA recognizing L.