GATE Computer Science (CS) 2017 Shift 2 Solved Paper

Question : 35 of 65

Marks: +1, -0

The minimum possible number of states of a deterministic finite automation that accepts the regular language L = {w₁aw₂ | w₁, w₂ ϵ {a, b}*, |w₁| = 2, |w₂| ≥ 3} is ________.