Scribd Logo
Upload

Welcome to Scribd!

  • Cs8501 - Theory of Computation

    Uploaded by

    praveenkumars.cse
    13 views6 pages
    S.Praveen Kumar, an assistant professor from Anand Institute of Higher Technology, Chennai, teaches the course CS8501 - Theory of Computation. The document discusses two types of NFA to DFA conversion: with epsilon and without epsilon. It provides the step-by-step procedure for converting an NFA without epsilon to a DFA, which involves finding the reachability set for each state and input, forming the transition table, and marking states as final if they contain a final state from the original NFA.

    Original Description:

    Original Title

    NFA to DFA2

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    S.Praveen Kumar, an assistant professor from Anand Institute of Higher Technology, Chennai, teaches the course CS8501 - Theory of Computation. The document discusses two types of NFA to DFA conversion: with epsilon and without epsilon. It provides the step-by-step procedure for converting an NFA without epsilon to a DFA, which involves finding the reachability set for each state and input, forming the transition table, and marking states as final if they contain a final state from the original NFA.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    13 views6 pages

    Cs8501 - Theory of Computation

    Uploaded by

    praveenkumars.cse
    S.Praveen Kumar, an assistant professor from Anand Institute of Higher Technology, Chennai, teaches the course CS8501 - Theory of Computation. The document discusses two types of NFA to DFA conversion: with epsilon and without epsilon. It provides the step-by-step procedure for converting an NFA without epsilon to a DFA, which involves finding the reachability set for each state and input, forming the transition table, and marking states as final if they contain a final state from the original NFA.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 6

    CS8501 – THEORY OF

    COMPUTATION
    NAME : S.PRAVEEN KUMAR
    DESIGNATION: ASSISTANT PROFESSOR
    COLLEGE: ANAND INSTITUTE OF HIGHER
    TECHNOLOGY, CHENNAI
    DEPARTMENT: COMPUTER SCIENCE AND
    ENGINEERING
    NFA TO DFA Conversion

    Two Types of NFA to DFA Conversion


    -NFA with epsilon to DFA Conversion
    -NFA without epsilon to DFA Conversion
    NFA without Epsilon to DFA
    Conversion
    • Procedure
    • Step1: Find ∫(initial state,input) and mark that as new
    state
    • Step2: Use the formula
    ∫(newstate,input) with the new state and all the inputs
    • Step3: Repeat step2 until no more new state is formed
    • Step4: Form the Transition Table
    • Step5: Make a new state as final state if it has final
    state of given NFA
    Example

    You might also like