This class defines a language L as a possibly$-$infinite set of words. Our goal is to be able to develop machines that can decide if a given word w belongs to L$.$

Our first attempt at exploring such machines is having us look at the regular expression, which is a compact, finite way of describing the words that belong to some language.