in Theory of Computation
198 views
0 votes
0 votes

LET L1={anbmcn |m,n>=0}

L2={ancn}|n>=0}

both are cfl ,what is L2-L1??

i am getting { }............please verify??

in Theory of Computation
by
198 views

3 Comments

1
1
oh it is L2 - L1.
ya it is "{}"
1
1
thanks
0
0

1 Answer

0 votes
0 votes
L2-L1=$L2\bigcap L1'$  we can see there is no any string which is common in L2 and L1' that's why answer will be {}.

Related questions