Question is saying about regular language bcz all these things have finite memory . so D is the answer.
Explanation
we have Theorem that if a language is regular then it must have a FA.
DFA isalso a special type of NFA with no null move ,and no choice. and again for every FA we can write a regular expression.