retagged by
785 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

0 votes
0 votes
1 answer
3
atulcse asked Jan 21, 2022
833 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?
3 votes
3 votes
1 answer
4
rahul sharma 5 asked Aug 5, 2017
1,134 views
L1=$a^{n}b^{m}c^{n}$, n,m>=0L2=$a^{n}c^{n}$ ,n>=0L2-L1?a. Regularb.Finitec.DCFld.Non regular