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 831 views 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 Show 9 previous comments 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.