Construct a DFA, that accepts string 'ab' over ∑={a,b}
SOLUTION:
∑={a,b}
L = {ab}
Ø So DFA can be Q={ q0 , q1 , q2},∑={a,b}, q0={ q0},F={q2} and δ is given by the table
1)Transition
diagram:
2)Transition Table:
Present State
|
Next State
|
|
Input a
|
Input b
|
|
à q0
|
q1
|
D
|
q1
|
D
|
q2
|
* q2
|
D
|
D
|
D
|
D
|
D
|
3)Transition function:
δ( q0, a)= q1 ,δ
(q0,b)= D
δ( q1, a)= D ,δ (q1,b)= q2
δ( q2, a)= D ,δ
(q2,b)= D
δ( D, a)= D ,δ
(D, b)= D
Comments
Post a Comment