Max-product Fuzzy Context-free Grammars and Pushdown Automata
Lan Shu · Mohu xitong yu shuxue · 2006
Based on the literature [1], the relation between a Max-Product Fuzzy context-free Grammars and pushdown automata is discussed. i.e. through a known max-product Fuzzy context-free grammars, there exists a max-product Fuzzy pushdown automata MPA such that L(G)= L(MPA), vice versa. So language can be recognized automatically.