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:

Example of DFA

If you found any type of error on the answer then please mention on the comment or report an answer or submit your new answer.
Leave your Answer:

Click here to submit your answer.

Notify of
Newest Most Voted
Inline Feedbacks
View all comments