Skip to content
Related Articles

Related Articles

Improve Article

GATE | GATE-CS-2003 | Question 90

  • Last Updated : 28 Jun, 2021

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

(A) 1
(B) 5
(C) 7
(D) 8


Answer: (C)

Explanation: Given a language of 7 bit strings where 1st, 4th and 7th bits are 1.

The following are 7 strings of language that can be accepted by DFA.

1001001
1001011
1001101
1001111

1101001
1111001
1011001




Quiz of this Question

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up