0 votes 0 votes is L a regular lang. or CFL ? L={XWWR |w$\epsilon$(0+1)+ ,x$\epsilon$(0+1)+} explain how? hitendra singh asked Sep 30, 2018 hitendra singh 578 views answer comment Share Follow See all 11 Comments See all 11 11 Comments reply Show 8 previous comments hitendra singh commented Sep 30, 2018 reply Follow Share I have clearly mentioned that there is no a & b in the language but isn't i possible to make Npda . because in Npda you have to go through every possibility if after going through all possibility you don't accept then only you can reject . 0 votes 0 votes Swapnil Naik commented Sep 30, 2018 reply Follow Share yeah I know I was just giving example. 1 votes 1 votes Swapnil Naik commented Oct 1, 2018 reply Follow Share Sorry its not regular but it can be accepted by npda. It is non-deterministic cfl https://gatecse.in/identify-the-class-of-a-given-language/ 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes It is not a CFL. pradeepchaudhary answered Sep 30, 2018 pradeepchaudhary comment Share Follow See all 3 Comments See all 3 3 Comments reply Shubhanshu commented Oct 1, 2018 reply Follow Share No the given language is CFL and is accepted by NPDA. 2 votes 2 votes hitendra singh commented Oct 1, 2018 reply Follow Share can you explain a bit ? 0 votes 0 votes Shubhanshu commented Oct 1, 2018 reply Follow Share It is of the form (0+1)^+ww^r which is CFL. 0 votes 0 votes Please log in or register to add a comment.
