615 views
–1 votes
–1 votes

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.

1 Answer

0 votes
0 votes
Correct me if I am wrong but I am being very specific to the given grammar.I think the answer is CSL,but I don't know if my logic behind it is correct please validate my answer.

Related questions

1 votes
1 votes
3 answers
2
1 votes
1 votes
1 answer
3
Souvik33 asked Dec 4, 2022
332 views
Consider the following statementS: $\left \{ a^{n}b^{n+k}|n\geq 0,k\geq 1 \right \} \cup \left \{a^{n+k}b^{n}|n\geq 0,k\geq 3 \right \}$ is DCFLThe above statement is:TRU...
0 votes
0 votes
0 answers
4