retagged by
880 views

1 Answer

0 votes
0 votes
Language is regular and regular expression is : bb*cb*b Complement of L = L(G') = (a+b)* - bb*cb*b
edited by

Related questions

931
views
1 answers
0 votes
atulcse asked Jan 21, 2022
931 views
Given a CFG and a string, what is the relation between the number of leftmost derivations, the number of rightmost derivations and the number of parse trees?
1.2k
views
1 answers
3 votes