McqMate
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 |
Answer» A. Accepted by DFA |
View all MCQs in
Theory of ComputationNo comments yet