Q. 28 The minimum possible number of states of a deterministic finite automaton that accepts a regular language
L = {w1aw2 | w1, w2 ∈{a,b}* , |w1| = 2, w2>=3} is_______
(A) 3
(B) 5
(C) 8
(D) 7
Answer: (C)
Explanation:
Q. 28 The minimum possible number of states of a deterministic finite automaton that accepts a regular language
L = {w1aw2 | w1, w2 ∈{a,b}* , |w1| = 2, w2>=3} is_______
(A) 3
(B) 5
(C) 8
(D) 7
Answer: (C)
Explanation:
