523 views

1 Answer

Best answer
4 votes
4 votes
Option B.
$L1^{3}$ = L1 . L1 . L1   (Concatenation of L1 3 times).

You have already found the Grammar of L1.

Just add this line in your production of L1.

X $\rightarrow$ SSS

Now X will be the start symbol.

Option C.
L1* = $L1^{0}$ $\cup$ $L1^{1}$ $\cup$ $L1^{2}$ $\cup$ ....... So on.

Add this line in the production of L1.

Y $\rightarrow$ SY / $\epsilon$

Now Y will be Start symbol.
selected

Related questions

1 votes
1 votes
4 answers
1
Subham Nagar asked May 6, 2018
736 views
L= { $a^{n}b^{m}$ | $n<=m<=2n$ }a) DCFLb) CFL but not DCFLc) Not CFL
0 votes
0 votes
1 answer
3
Rahul_Rathod_ asked Dec 24, 2018
563 views
consider following grammerS → aSb / aSbb / aSbbb / …..is language generated by above grammer is DCFL?
1 votes
1 votes
1 answer
4
practicalmetal asked Mar 20, 2023
358 views
The complement of the languages:i) {ww | w in (0+1)*}ii) {$a^n b^nc^n$ | n>1} area) Context Free b) Not Context Free c)are DCFL’s d)None