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

642
views
1 answers
0 votes
iarnav asked Sep 17, 2017
642 views
The following question is a modified version of this question https://gateoverflow.in/3785/gate2005-it-38, in this GATE question they have NPDA, but I'm asking about ... P) are necessarily Σ*.Neither L(P) nor N(P) are necessarily Σ*.
807
views
1 answers
0 votes
smartmeet asked Jan 12, 2017
807 views
For $A,B\subseteq \Sigma ^{*},$ define$A/B=\{x\in\Sigma^{*}\mid \exists y\in B,xy\in A\}$If $L$ is a $\text{CFL}$ and $R$ is $\text{Regular},$ then $L/R$ is$?$RegularCFL but not RegularRecursive but not CFLNone of the above
980
views
1 answers
0 votes
atulcse asked Jan 21, 2022
980 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
rahul sharma 5 asked Aug 5, 2017
1,204 views
L1=$a^{n}b^{m}c^{n}$, n,m>=0L2=$a^{n}c^{n}$ ,n>=0L2-L1?a. Regularb.Finitec.DCFld.Non regular