Equivalence of NFAs and DFAs

Construct a DFA from a NFA

In this lesson, we will show how to convert a NFA to a DFA. Consider the language $L$ over $\{ a,b \}$, which consists of strings that end and begin with the same symbol, i.e., $L = \{ \textrm{all strings of length at least two that begin and end with the same symbol} \}.$

The NFA that accepts the language L is depicted in the figure below.