关键词: 格半群 树自动机 上下文无关树文法 正规形式 等价文法

Abstract:

In this paper, the definitions of fuzzy tree automata and fuzzy context-free tree grammars are extended to a more general lattice-ordered monoid. It i  s shown that they are equivalent in the sense of accepting and generating languages. Meanwhile, a method to construct a normalized form for a lattice-va  lued context-free tree grammar is presented.

Key words: lattiee-ordered monoid, tree automata, context-free tree grammar, normalized form, equivalent grammar