A language is regular if and only if

• A. accepted by DFA
• B. accepted by PDA
• C. accepted by LBA
• D. accepted by Turing machine