The language accepted by finite automata can be easily described by simple 
expressions called Regular Expressions. A regular expression can also be 
described as a sequence of pattern that defines a string.