Exams › GATE › Technical

Consider the languages L1 = {ε} and L2 = {a}. Which one of the following represents L1 ∪ L2 ?

1. {ε}
2. Φ
3. a*
4. {ε, a}

Correct answer: {ε, a}

Solution

The union of two sets includes all unique elements from both sets. Since L1 contains the empty string ε and L2 contains the string 'a', their union results in the set {ε, a}.

Related GATE Technical questions

• The truth table X Y f(X,Y) 0 0 0 0 1 0 1 0 1 1 1 1 represents the Boolean function
• The decimal value 0.5 in IEEE single precision floating point representation has
• A process executes the code fork(); fork(); fork(); The total number of child processes created is
• The protocol data unit (PDU) for the application layer in the Internet stack is
• Which of the following problems are decidable? 1) Does a given program ever produce an output? 2) If L is a context-free language, then is L̄ also context-free? 3) If L is a regular language, then is L̄ also regular? 4) If L is a recursive language, then is L̄ also recursive?
• A binary operation ⊕ on a set of integers is defined as x ⊕ y = x² × y². Which one of the following statements is TRUE about ⊕?

⚔️ Practice GATE Technical free + battle 1v1 →