On Intuitionistic Fuzzy Context-Free Languages

Abstract EN

Taking intuitionistic fuzzy sets as the structures of truth values, we propose the notions of intuitionistic fuzzy context-free grammars (IFCFGs, for short) and pushdown automata with final states (IFPDAs).

Then we investigate algebraic characterization of intuitionistic fuzzy recognizable languages including decomposition form and representation theorem.

By introducing the generalized subset construction method, we show that IFPDAs are equivalent to their simple form, called intuitionistic fuzzy simple pushdown automata (IF-SPDAs), and then prove that intuitionistic fuzzy recognizable step functions are the same as those accepted by IFPDAs.

It follows that intuitionistic fuzzy pushdown automata with empty stack and IFPDAs are equivalent by classical automata theory.

Additionally, we introduce the concepts of Chomsky normal form grammar (IFCNF) and Greibach normal form grammar (IFGNF) based on intuitionistic fuzzy sets.

The results of our study indicate that intuitionistic fuzzy context-free languages generated by IFCFGs are equivalent to those generated by IFGNFs and IFCNFs, respectively, and they are also equivalent to intuitionistic fuzzy recognizable step functions.

Then some operations on the family of intuitionistic fuzzy context-free languages are discussed.

Finally, pumping lemma for intuitionistic fuzzy context-free languages is investigated.