bounded context language
5.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.We prove that the languages of these attractors are not a context-free language (CFL) but a con tex t-sensitive one (CSL).

