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

PYQ GATE 2023

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

LL = {ww ∈ {0,1}* | ww  does not contain three or more consecutive 1’s}.

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

Attempted by 276 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…