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} |
- A.
A and B
- B.
A and D
- C.
A, B and C
- D.
A, B, C and D
Attempted by 24 students.
Sign up free to check your answer
Sign up freeLoading lesson…

