1 votes 1 votes Given answer: A Please explain Theory of Computation theory-of-computation finite-automata context-free-language + – shikharV asked Nov 24, 2015 • retagged Jul 4, 2017 by Arjun shikharV answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Language is regular and regular expression is : bb*cb*b Complement of L = L(G') = (a+b)* - bb*cb*b Digvijay Pandey answered Nov 24, 2015 • edited Nov 25, 2015 by Digvijay Pandey Digvijay Pandey comment Share Follow See all 12 Comments See all 12 12 Comments reply shikharV commented Nov 25, 2015 reply Follow Share The form of the grammar looks like that of a context sensitive language as its RHS has terminal as well as non terminals. Then how is it regular. Please elaborate a bit.. 1 votes 1 votes Praveen Saini commented Nov 25, 2015 reply Follow Share @digvijay, in both cases. @sv_jan5 if a language is regular then it is cfl and csl too. So we have CFG for it and CSG too. 0 votes 0 votes Digvijay Pandey commented Nov 25, 2015 reply Follow Share No sir .. L and l' can't be same. 0 votes 0 votes Praveen Saini commented Nov 25, 2015 reply Follow Share @digvijay G and G' are two different grammar (depending on the inclusion / exclusion of last production bA$\to$A). L(G) and L(G') are two languages, they are not related as complement of each other. 1 votes 1 votes Himanshu1 commented Nov 25, 2015 reply Follow Share What Grammars are u considering for G & G' .. And as i note these should be: G: G' : S -> bSb / AcA S -> bSb / AcA Ab -> A , Ab -> b Ab -> A , Ab -> b bA -> b bA -> b , bA -> A @praveen sir what do u say ? 0 votes 0 votes Praveen Saini commented Nov 25, 2015 reply Follow Share Yes, including bA $\to$A in G' 1 votes 1 votes Himanshu1 commented Nov 25, 2015 i edited by Himanshu1 Nov 25, 2015 reply Follow Share So, L(G) should be CFL & L(G') should be regular ?? 1 votes 1 votes Praveen Saini commented Nov 25, 2015 reply Follow Share Yes. 1 votes 1 votes biranchi commented Apr 21, 2016 reply Follow Share Praveen sir I can't understand and please explain how the L(G) is context free from the Context-Sensitive Productions ? S -> bSb / AcA Ab -> A , Ab -> b bA -> b Please explain how to approach the solution ? 0 votes 0 votes Praveen Saini commented Apr 22, 2016 reply Follow Share ^^ try to find the strings derived from this. Actually regular language can be written from context-free productions and from context sensitive productions too. whatever is regular language is also cfl and csl too. 0 votes 0 votes Kaluti commented Aug 6, 2017 reply Follow Share should not the L(g) = regular and the L(g') = cfl here be answer here becoz for second grammar we can not write regular expression for it plzz explain if i am wrong 0 votes 0 votes sarthak_07 commented Nov 22, 2021 reply Follow Share I think L(G)={b^m c b^n | m>=n} so it should be cfl (dcfl) and L(G’)=bb*cb*b so it should be regular. Hence correct option should be B. @Praveen sir please verify. 0 votes 0 votes Please log in or register to add a comment.