Scribd Logo
Upload

Welcome to Scribd!

  • Unit I: Property 1: The Regular Sets Are Closed Under Union, Concatenation, and Kleene

    Uploaded by

    Indumathy Kavandiran
    8 views3 pages
    The document covers the key concepts of sets, relations, languages and automata theory. It discusses operations on sets and languages, as well as properties of regular languages and non-deterministic finite automata. The document also defines pushdown automata, including how they accept strings by final state or empty stack. It examines the equivalence of context-free grammars and pushdown automata, and introduces Chomsky normal form and Greibach normal form for context-free grammars.

    Original Description:

    Original Title

    QstnsOnTheory

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document covers the key concepts of sets, relations, languages and automata theory. It discusses operations on sets and languages, as well as properties of regular languages and non-deterministic finite automata. The document also defines pushdown automata, including how they accept strings by final state or empty stack. It examines the equivalence of context-free grammars and pushdown automata, and introduces Chomsky normal form and Greibach normal form for context-free grammars.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    8 views3 pages

    Unit I: Property 1: The Regular Sets Are Closed Under Union, Concatenation, and Kleene

    Uploaded by

    Indumathy Kavandiran
    The document covers the key concepts of sets, relations, languages and automata theory. It discusses operations on sets and languages, as well as properties of regular languages and non-deterministic finite automata. The document also defines pushdown automata, including how they accept strings by final state or empty stack. It examines the equivalence of context-free grammars and pushdown automata, and introduces Chomsky normal form and Greibach normal form for context-free grammars.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 3

    Unit I Basic Concepts of 1. Set 2. Operations on Set 3. Cartesian Product of Two Sets 4. Cardinality of Sets 5.

    Relation
    Property 1: The regular sets are closed under union, concatenation, and Kleene closure.

    Operations on Language 1. Union 2. Concatenation 3. Intersection 4. Difference Empty Set Subset Union of two Sets Intersection of two sets Equivalence of NFA & DFA Equivalence of Moore & Mealy Machines

    Unit II Definition of PDA Design of PDA Acceptance by PDA. ANSWER: There are two ways in which PDA accepts: 1. Acceptance by Final State 2. Acceptance by Empty Stack

    Equivalence of CFG and PDA Properties of PDA

    FORMAL DEFINITION OF A CONTEXT-FREE GRAMMAR

    CHOMSKY NORMAL FORM (CNF) GREIBACH NORMAL FORM (GNF) Algorithm

    You might also like