Consider the language L over the alphabet {0, 1}, given below: $L $= {\(w…

GATE · 2023 · CS · Computer Science & IT

Consider the language L over the alphabet {0, 1}, given below:

$L$ = { $w$ ∈ {0,1}* | $w$ does not contain three or more consecutive 1’s}.

The minimum number of states in a Deterministic Finite-State Automaton (DFA) for $L$ is _______ .

Attempted by 244 students.

Consider the language L over the alphabet {0, 1}, given below: \(L \)= {\(w…