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

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