Consider the following deterministic finite state automaton M. Let S denote…

PYQ GATE 2003

Consider the following deterministic finite state automaton M.
GATECS2003Q50
Let S denote the set of seven bit binary strings in which the first, the fourth, and the last bits are 1. The number of strings in S that are accepted by M is

  1. A.

    1

  2. B.

    5

  3. C.

    7

  4. D.

    8

Attempted by 257 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…