aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Computer Science (GATE Exam) 2013 - Previous Question Paper Solution
  • Consider the languages L1 = $\phi$ and L2 = {a}. Which on...
Multiple choice

Consider the languages L1 = $\phi$ and L2 = {a}. Which one of the following represents L1 $L_2^$$UL_2^$?

  1. {$\in$}
  2. $\phi$
  3. $a^*$
  4. {$\epsilon, a$}
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Concatenation of empty language with any language will give the empty language and $L_1^=\phi_ = \epsilon$. Hence, $L_1 L_2^* UL_1^* = \{\epsilon \}$

Keep practicing — related questions

  • Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* U L1*
  • Consider the following languages: L1 = {WWR | W$\in$ {0, 1}*} L2 = {W # WR |W$\in$ {0, 1}*} where # is a sp...
  • Let L = L1 $\cap$ L2, where L1 and L2 are languages as defined below: L1 = $(a^m b^m\ ca^n b^m | m,n \ge 0)...
  • Let L = L1 $\cap$ L2, where L1 and L2 are languages as defined below: L1 = $(a^m b^m\ ca^n b^m | m,n \ge 0)...
  • Consider the languages L1 {an bn cm | n, m > 0} and L2 {an bm cm | n, m > 0}
  • Given the language L = {ab, aa, baa}, which of the following strings are in L*? 1) abaabaaabaa 2) aaaabaaaa...
  • L1 is a recursively enumerable language over$\sum$. An algorithm A effectively enumerates its words as w1,w...
  • Consider the languages L1 = {0i1j | i $\ne$ j}. L2 = {0i1j | i = j}. L3 = {0i1j | i = 2j +1}. L4 = {0i1j | ...
Play the full quiz 🎤 Practise this topic out loud
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy