Scribd
Upload
29 views2 pages

Er Bi Lpol Yt Echni Cuni Ver Si T Y Er Bi Ltechni Calengi Neer I Ngcol L Ege I Nfor Mat I Onsyst em Engi Neer I Ngdept - Name: ST Age

This document contains solutions to two questions about deterministic finite automata (DFAs). The first question asks about the language recognized by a given DFA, which is answered - the language contains any strings ending in "00" or "11". The second question asks to construct the equivalent DFA of a given non-deterministic finite automata (NFA) that recognizes strings ending in "01", which is answered by providing the state transition diagram of the equivalent DFA.

Uploaded by

Mohammed Jaffer
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
29 views2 pages

Er Bi Lpol Yt Echni Cuni Ver Si T Y Er Bi Ltechni Calengi Neer I Ngcol L Ege I Nfor Mat I Onsyst em Engi Neer I Ngdept - Name: ST Age

This document contains solutions to two questions about deterministic finite automata (DFAs). The first question asks about the language recognized by a given DFA, which is answered - the language contains any strings ending in "00" or "11". The second question asks to construct the equivalent DFA of a given non-deterministic finite automata (NFA) that recognizes strings ending in "01", which is answered by providing the state transition diagram of the equivalent DFA.

Uploaded by

Mohammed Jaffer
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/ 2

Er

bil
Poly
technicUniver
sit
y Name:
Er
bil
Techni
calEngineeri
ngColl
ege
St
age:
I
nfor
mati
onSy stem Engi
neer
ingDept
.

Q1/Whati
sthel
anguaget
hatt
hisDFAcanber
ecogni
zedi
t?

Sol
:
L={
00,
11,
000,
011,
100,
111,
0000,
0011,
0100,
0111,
1000,
1011,
1100,
1111,
…}
Thi
sDFAi
sacceptorr
ecogni
zeanyst
ri
ngst
hatendswi
th00or
11.
Q2/givenbel
owistheNFAforal anguageL={setofall
str
ings
over(
0,1)t
hatendswit
h‘01’
}.Constructi
tsequiv
alentDFA
0,
1

0 1
A B C

Sol
:
Er
bil
Poly
technicUniver
sit
y Name:
Er
bil
Techni
calEngineeri
ngColl
ege
St
age:
I
nfor
mati
onSy stem Engi
neer
ingDept
.

δNFA= δDFA=

0 1

A A,
B A

B φ C

C φ φ

You might also like