Gate2017 ss Q20

0. The minimum possible number of states of a deterministic automaton that accepts the regular language L = {w₁aw₂ | w₁, w₂ ∈ {a,b}*, |w₁|=2,|w₂|≥3} is _____.

Note – Numerical Type question

Answer
Comment
Array

Option : A
Explanation :
Answer is 8 states included one trap state(8)and final state(7).

3rd symbol from start is an 'a'

Forgot your password?

I agree with the Terms.