Show an NFA that accepts all binary strings with two 1’sin a row
or that contains three 0’s in a row.
NFA = Nondeterministic finite automaton
Please explain and show all work.

Q&A Education