Intuitionistic Fuzzy Pushdown Automata and Intuitionistic Fuzzy Context-Free Languages

نویسندگان

  • V. Ramaswamy
  • V Ramaswamy
چکیده

In this paper intuitionistic fuzzy pushdown automata, acceptance by empty stack and acceptance by final states and their equivalence is proved. It follows that intuitionistic fuzzy pushdown automata with empty stack and IFPDAs are equivalent. We propose the notions of intuitionistic fuzzy context-free grammars (IFCFGs), intuitionistic fuzzy languages generated by IFCFGs. Additionally, we introduce the concepts of intuitionistic Chomsky normal form grammar and Greibach normal form grammar.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Intuitionistic Fuzzy Context-Free Languages

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 c...

متن کامل

MINIMAL AND STATEWISE MINIMAL INTUITIONISTIC GENERAL L-FUZZY AUTOMATA

In this note, by considering the notions of the intuitionistic general L-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{L}$, there exists a minimal intuitionistic general L-fuzzy automaton recognizing $mathcal{L}$.We prove that the minimal intuitionistic general L-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...

متن کامل

I-homomorphism for BL-I-General L-fuzzy Automata

Taking into account the notion of BL-general fuzzy automaton, in the present study we define the notation of BL-intuitionistic general L-fuzzy automaton and I-bisimulation for BL-intuitionistic general L-fuzzy automaton.Then for a given BL-intuitionistic general L-fuzzy automaton, we obtain the greatest I-bisimulation. According to this notion, we give the structure of quotient BL-intuiti...

متن کامل

MINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES

In this paper, relations among the membership values of gener- alized fuzzy languages such as intuitionistic fuzzy language, interval-valued fuzzy language and vague language are studied. It will aid in studying the properties of one language when the properties of another are known. Further, existence of a minimized nite automaton with vague ( final) states for any vague regular language recog...

متن کامل

On Fuzzy $e$-open Sets, Fuzzy $e$-continuity and Fuzzy $e$-compactness in Intuitionistic Fuzzy Topological Spaces

The purpose of this paper is to introduce and study the concepts of fuzzy $e$-open set, fuzzy $e$-continuity and fuzzy $e$-compactness in intuitionistic fuzzy topological spaces. After giving the fundamental concepts of intuitionistic fuzzy sets and intuitionistic fuzzy topological spaces, we present intuitionistic fuzzy $e$-open sets and intuitionistic fuzzy $e$-continuity and other results re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014