A machine is represented by states Q, input alphabet Σ, transition function δ,…

PYQ UGC NET 2024

A machine is represented by states Q, input alphabet Σ, transition function δ, initial state q₀ and final state F. The machine accepts all the strings over Σ = {a, b}, which start and ended with any combination of all alphabet and abb works/lies as substring in all the strings to be accepted.
For the above specified passage, which of the following represents the regular expression?

  1. A.

    (a+b)*aab

  2. B.

    aba(a+b)*

  3. C.

    b(a+b)*b(a+b)*a(a+b)*

  4. D.

    (a+b)*abb(a+b)*

Attempted by 199 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…