Scribd
Upload
7 views

TOC Assignment

3rewwwwwwwww

Uploaded by

Sameer Najam
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

TOC Assignment

3rewwwwwwwww

Uploaded by

Sameer Najam
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 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