Gate CS-2012 Question Paper With Solutions

Q. 46 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.

Gate CS-2012 Question Paper With Solutions
The missing arcs in the DFA are

Gate CS-2012 Question Paper With Solutions

Answer: (D)

Explanation:

Gate CS-2012 Question Paper With Solutions

Learn More:   Gate EE-2006 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here