Define a DFA that accepts all even length binary strings that don't contain the substring “111”?
up vote
1
down vote
favorite
I think I have worked out a DFA that doesn't accept the substring "111," but I don't know how to account for accepting even length strings. Here is what I have so far. Any help would be greatly appreciated! Hi, thanks so much to everyone who's commented. I've made some updates to my answer, and I think it works now, but I'm still not sure. Here's an updated photo below.
finite-automata discrete-mathematics
share | cite | improve this question
edited 4 hours ago
asked 7 hours ag