5. Obtain the language recognised by the NDA shown below.
6. Convert the NDA to DFA given M
q q q
a b
q
= ({ , , }, { , }, , ,
0
1
2
0
δ
{ })
q 1
with state table as given below
a
b
q 0
{q 1 , q 2 }
∅
q 1
∅
{q 2 }
q 2
∅
{q 2 }
7. Determine the DFA that accepts the language
L aa
aba
b
(
)
*
*
*
+
+
8. Determine the DFA that accepts the language
L ab a ab a aa
( (
(
))
*
+
+
.
9. Determine the regular expression for the languages accepted by the
following automata:
(a)
(b)
(c)
DFA and NFA
101
a
a
a
b
b
a
a
a
b
b
b
a
b
b
b
a
q 3
q 1
q 2
q 4
q 0
0
1
0,1
1
0
1
0
0