retagged by
906 views

2 Answers

Best answer
6 votes
6 votes

$L^2 =L.L= \{a^nb^n\;|\;n>=0\}.\{a^mb^m\;|\;m>=0\}$

$=\{a^nb^na^mb^m\;|\;n,m>=0\}$

selected by
–1 votes
–1 votes

L={anbn|n>=0}

L2={anbn}{anbn} ={anbn . anbn}={a2nb2n}

It is concatenation and kleen closure operation on CFL

So, CFL closed under these two operation

Related questions

2 votes
2 votes
1 answer
2
Anjana Babu asked Nov 24, 2016
1,671 views
Please Explain why the following is accpeted/rejected by PDA . ( Need detail explanation )S1 = { 0n 0m 1n 0m | n,m>0 }S2 = { 0n 0m 1n 1m 0m | n,m>0 }S3 = { am 0m 1n...
0 votes
0 votes
1 answer
3
shekhar chauhan asked Jun 15, 2016
2,152 views
What does this Language Represents ? And what is the machine which is able to represent this Language.L = { a^i b^j c^k d^l } where i = k or j = lHow it is different fro...