Scribd
Upload
60 views6 pages

ITE-1006 Theory of Computation Digital Assignment-1

This document contains the details of two digital assignments completed by a student named Ashish Raj for the course Theory of Computation. It includes the student's name, registration number, faculty name, and slot. It then provides the details of two NFA models and their transition tables. Finally, it summarizes the questions asked which involve constructing DFAs for specific regular languages, and combines the DFAs to get the final model with 8 states.

Uploaded by

Ashish
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
60 views6 pages

ITE-1006 Theory of Computation Digital Assignment-1

This document contains the details of two digital assignments completed by a student named Ashish Raj for the course Theory of Computation. It includes the student's name, registration number, faculty name, and slot. It then provides the details of two NFA models and their transition tables. Finally, it summarizes the questions asked which involve constructing DFAs for specific regular languages, and combines the DFAs to get the final model with 8 states.

Uploaded by

Ashish
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

ITE-1006

THEORY OF COMPUTATION
DIGITAL ASSIGNMENT-1

Name- ASHISH RAJ Faculty- GUNAVATHI C.


Reg. No.-16BIT0138 Slot- F1+TF1
Є-closure (q0) = {q0,q1,q3}
Є-closure (q1) = {q1,q3}
Є-closure (q2) = {q2}
Є-closure (q3) = {q3}

NFA transition table:

ᵟ 0 1
*{q0} {q0,q1,q2,q3} { }
*{q1} {q2,q3} { }
{q2} { } {q1,q3}
*{q3} {q3} { }

NFA model:
Є-closure (q0) = {q0}
Є-closure (q1) = {q1,q2}
Є-closure (q2) = {q2}
Є-closure (q3) = {q3,q4}
Є-closure (q4) = {q4}
NFA transition table:

ᵟ a b
{q0} {q1,q2,q3,q4} { }
{q1} {q1,q2,q3,q4} { q1,q2,q3,q4}

{q2} { q3,q4} { q1,q2,q3,q4}

*{q3} { q3,q4} { q1,q2,q3,q4}

*{q4} { } { }
NFA model:

Considering a=0 and b=1


So, according to the question:-

First we divide it so that we make two DFA’s and combine by cross.

a) Number of a’s is even with ∑ = {a, b}.

DFA Model for language L:-


a) Number of b’s divisible by three with ∑ = {a, b}.

We are taking the case that; zero is also divisible by 3.

DFA MODEL for language L:

By combining we get 2X4 finite states


i.e., {A,B} X {C,D,E,F}

DFA model:
DFA model:

You might also like