Finite Automata and Regular Expressions are equivalent. Any
language that can be represented with a regular expression can be
accepted by some finite automaton, and any language accepted by
some finite automaton can be represented by a regular
expression.