Consider the given below languages L1 and L2.
L1= {pnqmrmsn | m,n ≥ 0}
L2= {pnqnrmsm | m,n ≥ 0}
Select the correct statement about, L such that
L= (L1 U L2 ) – (L1 ꓵ L2 )
1.
L is CFL but not DCFL
2.
L is regular
3.
L is CSL but not CFL
4.
L is DCFL but not regular
i know that L is representing the EX-OR of L1 and L2, couldn't visualize as how it will be cfl. please help.