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

💬 Discuss

✅ Correct Answer: (A) Accepted by DFA

Published by Mr. Dubey ⭐ 111.42K Points at 18-Sep-2023 04:33 pm in Theory of Computation

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

376

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

90%

Success Rate