retagged by
3,135 views
2 votes
2 votes

​Let $L_1, L_2$ be two regular languages and $L_3$ a language which is not regular.

Which of the following statements is/are always TRUE?

  1. $L_1=L_2$ if and only if $L_1 \cap \overline{L_2}=\phi$
  2. $L_1 \cup L_3$ is not regular
  3. $\overline{L_3}$ is not regular 
  4. $\overline{L_1} \cup \overline{L_2}$ is regular
retagged by

1 Answer

1 votes
1 votes

A is wrong

As double implication we need to check both sides and take a case where L1 is subset of L2 still intersection of the statement will be null.

Option B is wrong

because, take L1 as (a+b)*, now union of any non-regular language over alphabet a and b will always be regular.

Correct answers:

C and D

C is trivial and D is closure property where Regular languages are closed under both compliment and union.

Answer:

Related questions

2.9k
views
1 answers
1 votes
Arjun asked Feb 16
2,949 views
​Consider the $5$ -state $\text{DFA}$. $M$ accepting the language $L(M) \subset(0+1)^{*}$ shown below. For any string $w \in(0+1)^*$ let $n_0(w)$ be the number of $0^{\...
4.0k
views
2 answers
4 votes
Arjun asked Feb 16
4,037 views
Which of the following statements about a relation $\mathbf{R}$ in first normal form $\text{(1NF)}$ is/are TRUE?$\mathbf{R}$ can have a multi-attribute key$\mathbf{R}$ ca...
3.5k
views
2 answers
1 votes
Arjun asked Feb 16
3,522 views
Which of the following statements about threads is/are TRUE?Threads can only be implemented in kernel spaceEach thread has its own file descriptor table for open filesAll...
3.4k
views
1 answers
2 votes
Arjun asked Feb 16
3,371 views
Which of the following process state transitions is/are NOT possible?Running to ReadyWaiting to RunningReady to WaitingRunning to Terminated