Consider the following Deterministic Finite Automaton M. Let S denote the set…

ISRO Scientist/Engineer SC 2014

Consider the following Deterministic Finite Automaton M.

DFA diagram: five states q0 (start) through q4 (accepting, double circle) in a row

Let S denote the set of eight-bit strings whose second, third, sixth and seventh bits are 1. The number of strings in S that are accepted by M is ____

  1. A.

    0

  2. B.

    1

  3. C.

    2

  4. D.

    3

Attempted by 421 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…