A student is revising regular expression. Which explanation should be selected?

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