next up previous contents
Next: Neil Gershenfeld's digression Up: Regular Sets Continued Previous: Ben's synopsis

Han's elaboration

Regular languages are a subset of $\Sigma^{*}$. A regular language is accepted by a FA, and FAs must have a finite number of states. Therefor, if I have a regular language there is a FA with a minimum number of states n.