Authors: Somaye Moghari Mohammad Mehdi Zahedi
Publish Date: 2015/03/08
Volume: 50, Issue: 1-2, Pages: 417-436
Abstract
This paper presents a contribution to the problem of similaritybased minimization of deterministic fuzzy finite tree automata DFFTA The main question is how to minimize the number of states of a complete and reduced DFFTA such that the languages of the original automaton and the minimized one be similar but not necessarily equal Based on extended concepts of fuzzy distance and similarity measures on Lfuzzy sets we introduce the notion of similaritybased minimal sminimal DFFTA which approximately accepts a fuzzy tree language Then a solution for handeling the tradeoff between the amount of reduction and the quality of preserving the behavior of system is presented The paper deals with fuzzy tree automata over complete lattices but identical results can also be obtained in a more general context for fuzzy tree automata over complete residuated lattices latticeordered monoids and even for weighted automata over commutative semirings
Keywords: