GATE CSE · Theory of Computation · Quiz
5 real GATE CSE questions on Theory of Computation. Instant scoring and solutions, no signup — see where you stand in ~3 minutes.
Question 1 of 5
EASYLet L be a regular language over the alphabet {0, 1}. Which of the following languages is guaranteed to be regular?