Consider the language \(L=\left\{a^{n} b^{m}: n \geq 4, m \leq 3\right\}\)…

PYQ UGC NET 2022

Consider the language L={anbm:n≥4,m≤3}L=\left\{a^{n} b^{m}: n \geq 4, m \leq 3\right\}

Which of the following regular expression represents language LL ?

  1. A.

    aaaa* (𝜆+𝑏+𝑏𝑏+𝑏𝑏𝑏)

  2. B.

    aaaaa*(𝑏+𝑏𝑏+𝑏𝑏𝑏)

  3. C.

    aaaaa *(𝜆+𝑏+𝑏𝑏+𝑏𝑏𝑏)

  4. D.

    aaaa* (𝑏+𝑏𝑏+𝑏𝑏𝑏)

Attempted by 225 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…