A language L is said to be recursively enumerable if:

A$.$ There exists a Turing machine that accepts L and halts on all inputs

B$.$ There exists a Turing machine that accepts L but may not halt on all inputs

C$.$ There exists a finite automaton that accepts L

D$.$ L can be described by a regular expression