1 votes 1 votes Caption Is this CFL or DCFL or not CFL Theory of Computation theory-of-computation dcfl context-free-language + – Nitesh Choudhary asked Jul 13, 2017 Nitesh Choudhary 470 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes Not CFL, it's CSL. PDA can't do more than one comparison on one variable, or two separate conditions with AND. L=${a^{n} b^{n} c^{2n}}$ Once PDA is done with the comparisons of a's and b's, nothing is left for c's. Manu Thakur answered Jul 13, 2017 selected Jul 29, 2017 by Vijay Thakur Manu Thakur comment Share Follow See all 2 Comments See all 2 2 Comments reply Nitesh Choudhary commented Jul 13, 2017 reply Follow Share Thanks I got it 0 votes 0 votes Manu Thakur commented Jul 13, 2017 i edited Jul 13, 2017 reply Follow Share okay! 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes NOT CFL because it has more than one comparison on same variable means 'n' Prateek Raghuvanshi answered Jul 13, 2017 Prateek Raghuvanshi comment Share Follow See all 0 reply Please log in or register to add a comment.