1 votes 1 votes $L=\{wxyw|w,x,y\in (a+b)^+ \}$ $L$ is ? Regular Deterministic CFL Non-deterministic CFL CSL Theory of Computation theory-of-computation identify-class-language + – Verma Ashish asked Mar 28, 2019 edited May 4, 2019 by akash.dinkar12 Verma Ashish 363 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes d. CSL Since, the substring xy cannot be determined using a PDA, the above language is a context sensitive language. Had xy been a finite string containing a or b, then it would have been a deterministic CFL. imShreyas answered Mar 28, 2019 imShreyas comment Share Follow See 1 comment See all 1 1 comment reply Gateasp2020 commented May 3, 2019 reply Follow Share plz give detail explananation?? 0 votes 0 votes Please log in or register to add a comment.