engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
\(S→ABC\\ A\to 0A1|\epsilon\\ B\to 1 B |\epsilon\\ C\to 1 C 0| \epsilon\)
Which of the following string does NOT belong to the above grammar?
1
000111110
2
000011111
3
111110000
4
000111100