Question: Find a nondeterministic finite-state automaton that recognizes each of the languages in Exercise, and has fewer states, if possible, than the deterministic automaton you found in that exercise.
Exercise: Find a deterministic finite-state automaton that recognizes each of these set
a) {0}
b) {1, 00}
c) {1n |n = 2, 3, 4,. . .}