将模糊自动机的同态、完全、容许关系等概念引入到模糊树自动机中,从代数的角度研究模糊树自动机的一些代数性质,并探讨了模糊树自动机的语言的相关问题。
In this paper,we introduce some concepts of fuzzy finite state machines such as homomorphism, completeness, admissible relation to some algebraic properties on finite fuzzy tree automata, and it would be discussed from the view of the algebra. We also discuss some tree language related questions of finite fuzzytree automata.