Design DFA with ∑ = {0, 1} accepts the set of all strings with three consecutive 0’s.
The strings that will be generated for this particular language are 000, 0001, 1000, 10001, …. in which 0 always appears in a clump of 3. The transition graph is as follows:
Click here to submit your answer.
