SUPARN PATRA
Schools
Exams
Paths
Blog
Quizzes
Tools
Playground
About
Home
/
Quizzes
/
GATE CS
/
Theory of Computation
GATE CS
Theory of Computation
10 questions
Question 1 of 10
Score:
0
/ 0
Which of the following languages is NOT regular?
A
L = {w | w is a binary string with an even number of 0s}
B
L = {w | w is a binary string with length divisible by 3}
C
L = {0^n 1^n | n >= 1}
D
L = {w | w is a binary string containing '01' as a substring}
← Back to unit notes