• recategorized by
4,185 views
4 4 votes

Consider the following types of languages:

$\text{L1}:$ Regular,

$\text{L2}:$ Context-free,

$\text{L3}:$ Recursive,

$\text{L4}:$ Recursively enumerable.

Which of the following is/are $\text{TRUE}$ ?

  1. $\text{L3}’ \cup \text{L4}$ is recursively enumerable
  2. $\text{L2} \cup \text{L3}$ is recursive
  3. $\text{L1}^{\ast} \cup \text{L2}$ is context-free
  4. $\text{L1} \cup \text{L2}’$ is context-free
  1. $\text{I}$ only
  2. $\text{I}$ and $\text{III}$ only
  3. $\text{I}$ and $\text{IV}$ only
  4. $\text{I, II}$ and $\text{III}$ only

1 Answer

Best answer
3 3 votes

 Answer: D

  1. Recursive languages are closed under complementation hence $L_3’$ is recursive, and recursively enumerable too, and REL is also closed under union. So, 
    $L_3’  \cup L_4 $ is recursively enumerable.
     
  2. $L_2$ is CFL hence recursive too and recursive is closed under union. Therefore,
    $L_2 \cup L_3$ is recursive.
     
  3. $L_1$ is regular language and it is closed under kleen star operation, hence $L_1^*$ is regular hence CFL too, and CFL is closed under union operation. So,
    $L_1^*$ $\cup$ $L_2$ is CFL.
     
  4. CFL are not closed under complementation. Therefore $L_2’$ may or may not be CFL but every CFL is also CSL and CSL is closed under complementation. So, $L_1 \cup L_2’$ is CSL (may or may not be CFL).

    Refer: https://gatecse.in/closure-property-of-language-families/
• selected by
Answer:
Position:
Show:

Related questions

1 1 vote
0 0 answers
670
670 views
soujanyareddy13 asked Apr 12, 2022
670 views
$\text{L1}$ is a recursively enumerable language over $\Sigma$. An algorithm $A$ effectively enumerates its words as $w_1, w_2, w_3, \dots$ Define another language $\text...
1 1 vote
0 0 answers
593
593 views
soujanyareddy13 asked Apr 12, 2022
593 views
Consider the set of strings on $\{0,1\}$ in which, every substring of $3$ symbols has at most two zeros. For example, $001110$ and $011001$ are in the language, but $1000...
0 0 votes
0 0 answers
587
587 views
soujanyareddy13 asked Apr 12, 2022
587 views
Consider the following problem $\text{X}$.Given a Turing machine $\text{M}$ over the input alphabet $\Sigma$, any state $q$ of $\text{M}$ and a word $w \in \Sigma^{\ast}$...
1 1 vote
0 0 answers
684
684 views
soujanyareddy13 asked Apr 12, 2022
684 views
Consider the following two statements:A hash function (these are often used for computing digital signatures) is an injective function.encryption technique such as $\text...