最大乘积型Fuzzy上下无关文法与下推自动机

Max-product Fuzzy Context-free Grammars and Pushdown Automata

在文献[1]的基础上,讨论了最大乘积型Fuzzy上下文无关文法与最大乘积型Fuzzy下推自动机的关系,即:由给定的最大乘积型Fuzzy上下文无关文法可构造一个最大乘积型Fuzzy下推自动机使得二者接受的语言集相同,反之亦然。从而达到自动识别语言的目的。

Based on the literature [1], the relation Grammars and pushdown automata is discussed, i.e. between a Max-Product Fuzzy context-free through a known max-product Fuzzy contextfree grammars, there exists a max-product Fuzzy pushdown automata MPA such that L（G）= L（MPA）, vice versa. So language can be recognized automatically.