\input zb-basic
\input zb-ioport
\iteman{io-port 05734005}
\itemau{Bai, Mingqiang}
\itemti{Equivalency between the fuzzy tree languages and tree grammars.}
\itemso{J. Henan Norm. Univ., Nat. Sci. 37, No. 4, 15-18,30 (2009).}
\itemab
Summary: In the theory of formal languages and automata, there are four ways to describe fuzzy regular languages. Fuzzy regular languages are usually depicted by fuzzy regular expressions, finite automata and grammars. A fuzzy regular tree expression is introduced; then, the paper discusses recognizability and obtains a sufficient and necessary condition for a fuzzy tree language to be regular.
\itemrv{~}
\itemcc{}
\itemut{fuzzy tree; fuzzy tree automata; fuzzy regular tree language; fuzzy regular tree expressions}
\itemli{}
\end