Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 4 views

    TOC Assignment

    Uploaded by

    Sameer Najam
    3rewwwwwwwww

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    TOC Assignment

    Uploaded by

    Sameer Najam
    4 views2 pages
    3rewwwwwwwww

    Original Title

    TOC-Assignment

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    3rewwwwwwwww

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    4 views2 pages

    TOC Assignment

    Uploaded by

    Sameer Najam
    3rewwwwwwwww

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    THEORY OF COMPUTATION

    Assignment
    1. Design Deterministic Finite Automata which contains Even a's and Even b's in a string.
    Explain in 5 tuples.
    2. Convert the following NFA to its equivalent DFA.

    0 1
    ->q0 q0 q1 *represents final state
    q1 q1,q2 q1
    *q2 q2 q1,q2

    3. Produce the Minimized DFA of the following DFA with the help of equivalence method
    and also draw the minimized DFA.

    0 1
    ->q0 q1 q5
    q1 q6 q2
    *q2 q0 q2 *represents final state
    q3 q2 q6
    q4 q7 q5
    q5 q2 q6
    q6 q6 q4
    q7 q6 q2

    4. Convert є-NFA to DFA of the given State Diagram. And Show the Step by Step Process.
    5. Convert the following Moore machine into its equivalent Mealy machine.

    Present Input Input Output

    State 0 1

    A A B 0

    B C B 1

    C B C 0

    D C C 1

    You might also like