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
I got this question by my college professor while I was bunking the class.
I'd like to ask this question from Regular Language & Expression in section Regular Expressions and Languages of Automata Theory