retagged by
606 views

1 Answer

Best answer
9 votes
9 votes

Answer : D 

Your Given Language is L= {a^n b^n} where n>=0

Just for simplification we can break this down like this

L^2 ===> L.L ===> {a^n b^n where n>=0}.{a^m b^m where m>=0 } 

By doing this Language is not changed at all your given Language was DCFL .And it is still DCFL .Now we can combinedly write them down like this .

L^2 ={a^n b^n a^m b^m where m,n >=0}

selected by

Related questions

1 votes
1 votes
1 answer
1
0 votes
0 votes
3 answers
2
Anmol Verma asked Nov 30, 2016
2,266 views
S->AbaCA->BCB->b/epsilonC->D/epsilonD->d I want to know that will A contain epsilon as B and C both are null variables???(In Elimination of epsilon-production)
1 votes
1 votes
2 answers
3
shaff asked Jun 21, 2016
541 views
The production rules for a given context-free grammar are $S \rightarrow aA, A \rightarrow bB, A \rightarrow aB$ and $B \rightarrow a$ inChomsky normal formGreibach norma...