edited by
697 views
0 votes
0 votes

Consider the following languages :

L1: {a bn a2n | n ≥ 0 }

L2: { a a bn a3n | n ≥ 0 }

Which of the following is true ?

A. L1 U L2 is regular

B. L1 U L2 is DCFL

C. L1 intersection L2 is non regular

D. L1 U L2 is not CFL

edited by

Please log in or register to answer this question.

Related questions

2 votes
2 votes
1 answer
1
srestha asked Nov 26, 2018
542 views
$L_{1}=\left \{ 0^{m}.1^{n}.2^{m}.3^{n} \right |n,m>0\}$$L_{2}=\left \{ a^{i}.b^{j}.c^{k}.d^{l} \right |i+k=j+l\}$which one DCFL?Refrence :https://gateoverflow.in/15327/c...
4 votes
4 votes
1 answer
2
1 votes
1 votes
1 answer
3
1 votes
1 votes
2 answers
4
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 ?