0 votes 0 votes How to understand such problems? Theory of Computation context-free-language identify-class-language context-free-grammar + – Parshu gate asked Nov 19, 2017 Parshu gate 636 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply srivivek95 commented Nov 19, 2017 reply Follow Share For this problem, check how many comparisons you need to do. L1: Number of 0 in the beginning should be equal to sum of the number of 1 & 0 thereafter. Only one comparison needed which can be solved using single stack. So, CFL. L2: Number of 0 in the beginning should be equal to number of 1 thereafter & number of 0 should be less than both of them. Two comparisons needed which can be solved using two stacks. So, CSL. L3: Number of 0 in the beginning should be equal to number of 1 & number of 0 thereafter. Two comparisons needed which can be solved using two stacks. So, CSL. 0 votes 0 votes Shiva Sagar Rao commented Apr 27, 2021 reply Follow Share Duplicate: https://gateoverflow.in/41233/which-of-these-languages-are-not-context-free 0 votes 0 votes Please log in or register to add a comment.
How to understand such problems?
