bounded context grammar
4.The concept of fuzzy pushdown automata is given, and the relation of a fuzzy context-free grammar and a fuzzy pushdown automata is provided, i.e. if and only if a fuzzy language is producal by a fuzzy context-free grammar, it can be accepted by a fuzzy pushdown automaton. So fuzzy context-free Language can be recognized automatically.
6.The research shows that if and only if a fuzzy language is produced by a max-product fuzzy context-free grammar,it can be accepted by a max-product fuzzy pushdown automaton,so the max-product fuzzy context-free language can be recognized automatically.


