0 votes 0 votes Consider the language given below: $L$ $=$ { $p$ $|$ $p$ $\neq$ $w$ $and$ $p$ $is$ $the$ $prefix$ $of$ $w$ $and$ $w$ $\epsilon$ {$0,1$}*} Which of following is true about L. A)L is CFL B)L is DCFL C)L is CSL D)L is regular Theory of Computation theory-of-computation identify-class-language test-series + – Pranavpurkar asked Nov 16, 2022 Pranavpurkar 425 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Pranavpurkar commented Nov 16, 2022 reply Follow Share Kabir5454 haha! yes that’s correct but how? 0 votes 0 votes Vishal_kumar98 commented Nov 16, 2022 reply Follow Share Which test series is formulating such poor questions? Kindly enlighten. 0 votes 0 votes Pranavpurkar commented Nov 16, 2022 reply Follow Share Vishal_kumar98 unacademy 1 votes 1 votes Please log in or register to add a comment.