Question: Construct nondeterministic finite-state automata(NDFSA) that recognize each of the sets in Exercise.
Exercise: Construct deterministic finite-state automata that recognize each of these sets from I ∗, where I is an alphabet.
a) ∅
b) {λ}
c) {a}, where a ∈ I