Which of the following Finite Automata recognizes the language L={a,b}*? A.…

PYQ UGC NET 2022

Which of the following Finite Automata recognizes the language L={a,b}*?

A. M=({q0},{a,b},δ,q0,{q0}), where δ is:

a

b

q0

{q0}

{q0}

B. M=({q0,q1},{a,b},δ,q0,{q0,q1}), where δ is:

a

b

q0

{q0,q1}

{q0,q1}

q1

{q1}

{q1}

C. M=({q0,q1},{a,b},δ,q0,{q0,q1}), where δ is:

a

b

q0

{q0,q1}

{q0}

q1

–

{q1}

D. M=({q0,q1,q2},{a,b},δ,q0,{q0}), where δ is:

a

b

q0

{q0}

{q0}

q1

{q2}

–

q2

{q0}

{q2}

  1. A.

    A and B

  2. B.

    A and D

  3. C.

    A, B and C

  4. D.

    A, B, C and D

Attempted by 24 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…