String X is accepted by finite automata if

Bihar STET 2024

String X is accepted by finite automata if

  1. A.

    δ*(q,x) E A

  2. B.

    δ(q,x) E A

  3. C.

    δ(Q0,x) E A

  4. D.

    δ*(Q0,x) E A

Attempted by 453 students.

Sign up free to check your answer

Sign up free

Explore the full course: Bpsc

Loading lesson…