Scribd Logo
Upload

Welcome to Scribd!

  • Automata

    Uploaded by

    Ananda Raman
    12 views1 page

    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

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    12 views1 page

    Automata

    Uploaded by

    Ananda Raman

    Copyright:

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

    NATIONAL INSTITUTE OF TECHNOLOGY, PUDUCHERRY KARAIKAL - 609 605

    CS202 Automata and Formal Languages Cycle test : 1,Marks :20,Time:1hour

    1.State Myhill-Nerode Theorem. 2.Prove Myhill-Nerode Theorem . 3.Prove that minimal DFA for a given Regular Language L is unique. 4.Convert the following NFA to DFA.(Also remove all unreachable states)

    (3) (7) (5) (3)

    5.Transition function of a dfa is defined as 6.Transition function of a nfa is defined as

    ______________________ ______________________

    (1) (1)

    You might also like