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

A. a language that always needs an infinite stack B. a language with no finite description C. a language that can be accepted by a finite automaton D. a language accepted only by a universal Turing machine