模糊树自动机语言的封闭性

摘要

The notions of ∑- algebra, ∑- tree, fuzzy ∑- tree automaton, the behavior of fuzzy ∑- tree automaton are given. The union, intersection, concatenation, Kleene closure of fuzzy tree automaton languages are introduced, and the closure of fuzzy tree automata languages under these operations is proved.%给出了∑-代数、∑-树、模糊∑-树自动机、模糊∑-树自动机行为的定义.引入了模糊树自动机语言的并、交、连接和Kleene闭包运算,证明了在这些运算下模糊树自动机语言的封闭性.