2 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 1.7k views answer comment Share Follow Print See all 5 Comments 5 5 Comments reply joshi_nitish commented Jan 6, 2018 reply Follow flag B) is not CFL... 3 3 replyShare Anu007 commented Jan 6, 2018 i edited by Anu007 Jan 6, 2018 reply Follow flag B is non CFL since when the number of comparision b/w a and c is finishing machine forget what is n and we cannot compare the number of d. 1 1 replyShare Hira Thakur commented Jan 7, 2018 reply Follow flag B is CSL?? 0 0 replyShare Ajay Jadhav commented Jan 16, 2018 reply Follow flag 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 0 replyShare Gurdeep Saini commented Nov 22, 2018 reply Follow flag B is not cfl D is not cfl because we have to compare n with m also after n,2n 1 1 replyShare Please log in or register to add a comment.
–1 –1 vote 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 4 4 Comments reply Sona Barman commented Jan 16, 2018 reply Follow flag What about 'a'? When a is push or pop? 0 0 replyShare Chandrabhan Vishwa 1 commented Jan 16, 2018 reply Follow flag option A is regular language in this it also be cfl push and pop not apply 1 1 replyShare Arjun commented Jan 16, 2018 reply Follow flag And who will ensure #a=#c? 1 1 replyShare Sona Barman commented Jan 16, 2018 reply Follow flag I am not talking about option A. 'a' input symbol. In option B as per your answer. 1 1 replyShare Please log in or register to add a comment.
