GATEverse Practice, past papers & mock tests
GATE 2023 · CS - Forenoon
Theory of ComputationFinite Automata: Regular LanguageshardNAT2 marks
Consider the language L over the alphabet {0,1}, given below: L = {w in {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 __________.
Save your progress

Related Theory of Computation PYQs