The previous chapter introduced the deterministic and nondeterministic finite automata (DFA and NFA) and regular expressions, all of which define the class of regular languages. In that chapter, we learned that the class of regular languages is closed under all set operations, concatenation, and the Kleene-star. This chapter studies the limitations of regular languages by showing that they capture only a fraction of all languages.