Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach

Q.) 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
Correct answer : Option (A) - Accepted by DFA

Share

Discusssion

Login to discuss.