edited by
662 views
1 votes
1 votes

$L1$ and $L2$ are regular languages. $L3$ is CFL and $L4$ is a recursive enumerable language. $L5$ is the reversal of $L4$.

If $L6= \{ (L3/y)$ intersection $L5 \}$ where $y$ is input alphabet, then $L6$ is a:

  1. Regular Language
  2. CFL
  3. Recursive Enumerable Language
  4. Non Recursive Enumerable Language
edited by

1 Answer

Best answer
2 votes
2 votes
Here L3 is CFL then also L3/y is CFL.
Now l5 is reversal of l4 and REL is closed under reversal.

Eg- a^nb^nc^nd^n after reversal it will still be REL.

So we know REL are closed under intersection so answer is c) Recursive Enumerable Language  .

in one word -  L3/y is cfl and L5 is recursive enumerable language. the intersection will result in recursive enumerable language.
selected by
Answer:

Related questions

6 votes
6 votes
2 answers
1
Bikram asked Nov 26, 2016
1,174 views
Given a regular grammar $G_1$ and a context free grammar $G_2$, the problem of deciding if $L(G_1)$ is a proper subset of $L(G_2)$ is:DecidableUndecidable but semi-decida...
0 votes
0 votes
1 answer
2
Bikram asked Nov 26, 2016
294 views
$G1$ and $G2$ are regular grammars and the language generated by any grammar $G$ is represented by $L(G)$. In this case, $L(G1) \cap L(G2) = \phi$ is a/an:Decidable prob...
0 votes
0 votes
1 answer
3
Bikram asked Nov 26, 2016
202 views
Recursive Enumerable Languages are NOT closed under :UnionIntersectionComplementHomomorphism
0 votes
0 votes
1 answer
4