What is meant by regular expression in Theory of Automata and Formal Languages?

A. a formal notation used to describe regular languages B. a tape alphabet for a Turing machine C. a proof that every language is decidable D. a parse tree for a context-free grammar