InterviewSolution
Saved Bookmarks
| 1. |
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» The correct answer is (a) Accepted by DFA To explain: All of above machine can accept regular language but all string accepted by machine is regular only for DFA. |
|