0 votes 0 votes Theory of Computation made-easy-test-series theory-of-computation identify-class-language + – pkb asked Feb 5, 2017 • edited Mar 5, 2019 by adeebafatima1 pkb 305 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes 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. Smriti012 answered Feb 5, 2017 • selected Feb 5, 2017 by pkb Smriti012 comment Share Follow See 1 comment See all 1 1 comment reply pkb commented Feb 5, 2017 reply Follow Share I also think like that but answer is b which is wrong. thanks for confirming..... 0 votes 0 votes Please log in or register to add a comment.