in Theory of Computation edited by
163 views
1 vote
1 vote
If

$L_1$= CFL $\cdot$ (Regular language)$*$

$L_2$= CSL $\cdot$ (Regular language)$*$

$L_3$=Recursive language $\cdot$ (Regular language)$*$

$L_4$= DCFL $\cap$ CFL

What can be said about $L_1,L_2,L_3$ and $L_4$?
in Theory of Computation edited by
163 views

Please log in or register to answer this question.