Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For examples, 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. The missing arcs in the DFA are

M

Mr. Dubey • 87.94K Points
Coach

Q. Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For examples, 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. The missing arcs in the DFA are

(A) A

(B) B

(C) C

(D) D

Correct Answer - Option(D)
Views: 862
Filed under category Theory of Computation and Compiler Design

Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. A Microsoft Windows is .....a(n)

Q. What is the full form of ANSI?

Q. Name one of the factors that govern the span of management.

Q. What is the type of inf?

Q. How many types of insertion anomalies:

Q. Which one of the following extends a private network across public networks?

Q. The degree to which actors are directly linked to one another through cohesive bonds is called as .

Q. The ------------ is produced at the culmination of the analysis task.

Q. Which of the following is responsible for quality objective?

Q. If L1 and L2 are context free language and R a regular set, then which one of the languages below is not necessarily a context free language?

Question analytics