Nondeterminism, NFAs. lambda (or "spontaneous") transitions: how to get rid of them without changing the language decided by the NFA. The "powerset machine" algorithm: NFAs and DFAs decide the same set of languages (i.e. the regular languages).