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

A. a language that must be finite B. a language accepted by a Turing machine that may not halt on non-members C. a language accepted only by Moore machines D. a language generated only by regular expressions