SOMAYE MOGHARI
MOHAMMAD MEHDI ZAHEDI

In this paper, we introduce two different methods for determinization of fuzzy tree automata. Given a nondeterministic fuzzy tree automaton on a pair of fuzzy operators (∇,Δ) , the first method constructs an equivalent deterministic fuzzy tree automaton Ad such that L(An ) = L(Ad ) , but An and Ad may have not the same behavior. Furthermore, if operators (∇,Δ) be finite range, the second method constructs an equivalent deterministic fuzzy tree automaton Ad′ such that its behavior is same as An and consequently L(An ) = L(Ad′ )

Automata Theory, Fuzzy Tree Automata, Determinization