MadeEasy Subject Test: Theory of Computation - Identify Class Language

Question

Answer 1

Answer : option D

L1: push all 0's ,pop 1 for each 0 , bypass all 2 | accepts empty string 

L1: push all 0's ,pop 1 for each 0 , bypass all 2 | not accepts empty string

Stack memory needed-> CFL and higher BUT not regular.

Comments

I also think like that but answer is b which is wrong.

thanks for confirming.....