从代数角度出发研究模糊树自动机的同余与同态,得出模糊树自动机的同态基本定理和同构基本定理,且对模糊树自动机的语言及模糊树自动机的极小化问题进行研究。
we investigate the congruence and homomorphism of fuzzy tree automata from the algebra angle,obtain the fuzzy tree automaton's homomorphism fundamental theorem and the isomo-rphism fundamental theorem.We also study the minimization and the language of fuzzy tree automata.