1,606 views

1 Answer

1 votes
1 votes

L1 = CFL // string matching is task of CFL , one stack is enough

L2 = CFL // same logic

L1∩L2 = anbnc// two stack needed for this so CFL can't do this so it's CSL

L1∪L2 =CFL // CFL close under union

Related questions

0 votes
0 votes
1 answer
1
1 votes
1 votes
1 answer
2
1 votes
1 votes
2 answers
3
ggwon asked Dec 29, 2022
701 views
L = {$a^{n+m}b^{n}a^{m} | n,m \geq 0$}Is the above language DCFL or CFL ?