2 votes 2 votes Is B context free? Please explain in detail. Theory of Computation context-free-language theory-of-computation identify-class-language regular-language grammar + – Shubham Kumar Gupta asked Jan 6, 2018 Shubham Kumar Gupta 813 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Hira Thakur commented Jan 7, 2018 reply Follow Share B is CSL?? 0 votes 0 votes Ajay Jadhav commented Jan 16, 2018 reply Follow Share In option B,we can't push c on top of a's to compare with d^2n,since we have to compare a^n to c^n(c's will pop a's and leaving d^2n to compare with nothing,with 1 stack it is not possible) 0 votes 0 votes Gurdeep Saini commented Nov 22, 2018 reply Follow Share B is not cfl D is not cfl because we have to compare n with m also after n,2n 1 votes 1 votes Please log in or register to add a comment.
–1 votes –1 votes Yes B is CFL because for a push operation for b by pass for c push and then for d pop two times hence empty stack got Chandrabhan Vishwa 1 answered Jan 7, 2018 Chandrabhan Vishwa 1 comment Share Follow See all 4 Comments See all 4 4 Comments reply Sona Barman commented Jan 16, 2018 reply Follow Share What about 'a'? When a is push or pop? 0 votes 0 votes Chandrabhan Vishwa 1 commented Jan 16, 2018 reply Follow Share option A is regular language in this it also be cfl push and pop not apply 1 votes 1 votes Arjun commented Jan 16, 2018 reply Follow Share And who will ensure #a=#c? 1 votes 1 votes Sona Barman commented Jan 16, 2018 reply Follow Share I am not talking about option A. 'a' input symbol. In option B as per your answer. 1 votes 1 votes Please log in or register to add a comment.