Run JFlap, and use File->Open to open the problem1.jff file that we have given you.
In problem1.jff, build a deterministic finite-state machine that accepts all bit strings containing at least three 1s and at most one 0, and that rejects all other bit strings.
This problem requires at least nine states. You may use more states if necessary (there’s no penalty for doing so), but if you have time, try to get as close to the minimum as possible!
Here are three examples of strings that should be accepted:
111 1111011 11111
Here are three strings that should be rejected:
11 1101101 0