-
The minimum possible number of states of a deterministic finite automata that accepts the regular language L = {w1 aw2 | w1 ,w2 ∈ {a, b}*, | w1 | = 2, |w2 | ≥ 3} is ________.
-
- 4
- 8
- 10
- 0
Correct Option: B
The Minimum possible number of states of deterministic finite Automata that accepts the regular language.
As given that,
L = { W1 a W2 | W1 , W2 ∈ {a , b}*, | W1 | = 2, | W2 | ≥ 3 } is
The regular expression for L is = (a + b)(a + b) a(a + b)(a + b)(a + b)(a + b )*
The minimal DFA accepting L is :
Hence, the minimum number of state are 8.
