A regular set is a language accepted by an FA. An important point is that not all strings are members of a regular set; Prime numbers represented as binary strings are an example of a non-regular set.
