考虑采用正则表达式,有限自动机和文法来描述,提出了模糊树正则表达式的概念,得到了模糊树正则语言的可识别性,并证明了模糊树语言是正则的充分必要条件,这为进一步讨论模糊树自动机奠定了基础.
In the theory of formal language and automaton, there are four ways to describe fuzzy regular languages. Fuzzy regular languages are usually depicted by fuzzy regular expressions, finite automaton and grammars. Fuzzy regular tree expression is introduced, then the paper discusses the recognizability, obtains the sufficient and necessary condition that fuzzy tree language is regular. It is a foundation of further researches on fuzzy tree.