Scribd
Upload
25 views2 pages

Q1/Gi Veadfaf or (A, B, C) T Hatnotaccept Sanyst R I Ngswi T H Aabasasubst R I NG

This document contains solutions to two questions about deterministic finite automata (DFAs). 1) The first question asks to design a DFA that does not accept any strings with "aab" as a substring. The solution provides a DFA with 5 states that meets this criteria. 2) The second question asks to minimize the given DFA. The solution describes minimizing the DFA through 4 steps of equivalence partitioning of the states, resulting in a minimized DFA with 2 equivalence classes of states.

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
25 views2 pages

Q1/Gi Veadfaf or (A, B, C) T Hatnotaccept Sanyst R I Ngswi T H Aabasasubst R I NG

This document contains solutions to two questions about deterministic finite automata (DFAs). 1) The first question asks to design a DFA that does not accept any strings with "aab" as a substring. The solution provides a DFA with 5 states that meets this criteria. 2) The second question asks to minimize the given DFA. The solution describes minimizing the DFA through 4 steps of equivalence partitioning of the states, resulting in a minimized DFA with 2 equivalence classes of states.

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/Giv
eaDFAf or∑={
a,b,
c}t
hatnotaccept
sanyst
ri
ngswi
th
aabasasubst
ri
ng.

Sol
:

b,
c a a,
b,
c
c

a a b

b,
c

Q2/mi
nimi
zet
hisDFA
0
0 1
A B D
0 1
0
1 0
C E
1

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

Sol
:
δDFA=

0equi
val
ence{A,B,C,D}{E}
1equi
val
ence{A,B,C}{D}{ E}
2equi
val
ence{A,C}{B}{
D}{ E}
3equi
val
ence{A,C}{B}{
D}{ E}
Wewil
lstopwhenwegetl ast
t
woequival
encesetsare

You might also like