Design a DFA with ∑ = {0, 1} accepts the only input 101.

Example of DFA

In the given solution, we can see that only input 101 will be accepted. Hence, for input 101, there is no other path shown for other input.

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
Inline Feedbacks
View all comments