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 had been asked this question in an online interview.
Origin of the question is Regular Grammar in chapter Contextfree Grammar and Syntax Analysis of Compiler