0 votes 0 votes Deepalitrapti asked Sep 5, 2018 Deepalitrapti 505 views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply Mizuki commented Sep 5, 2018 i edited by Mizuki Sep 6, 2018 reply Follow Share Well, it is a CFL. 1 votes 1 votes Shaik Masthan commented Sep 6, 2018 reply Follow Share why not a pda a possible for this question. NPDA is possible, please check it 0 votes 0 votes Deepalitrapti commented Sep 6, 2018 reply Follow Share How can u tell ?? 0 votes 0 votes Shaik Masthan commented Sep 6, 2018 reply Follow Share atmost only one comparison required at a time. right? 0 votes 0 votes Deepalitrapti commented Sep 6, 2018 reply Follow Share Yes 0 votes 0 votes Mizuki commented Sep 6, 2018 reply Follow Share @Shaik Masthan I don't understand how PDA can be constructed. Can you write the transition function or draw the PDA for the given problem? 0 votes 0 votes Mizuki commented Sep 6, 2018 reply Follow Share @Deepalitrapti In the question is it i ≠ j and k ≠ 2l? Or what? 0 votes 0 votes Deepalitrapti commented Sep 6, 2018 reply Follow Share Yes condition same 0 votes 0 votes arvin commented Sep 6, 2018 reply Follow Share the question says i<>k "or" j<>2l. so its a cfl... if it was "and" it wasnt a cfl.. 2 votes 2 votes Mizuki commented Sep 6, 2018 reply Follow Share Thanks @arvin your solution is helpful. 1 votes 1 votes Please log in or register to add a comment.