Skip to content
Related Articles

Related Articles

Improve Article

GATE | GATE CS 2012 | Question 65

  • Last Updated : 28 Jun, 2021

Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For example, 001110 and 011001 are in the language, but 100010 is not. All strings of length less than 3 are also in the language. A partially completed DFA that accepts this language is shown below.

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.

The missing arcs in the DFA are


(A) A
(B) B
(C) C
(D) D


Answer: (D)

Explanation: SeeĀ https://www.geeksforgeeks.org/automata-theory-set-2/

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :