A class of machine which accepts a ________ language is called finite state automata.

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Discrete Mathematics

Q. A class of machine which accepts a ________ language is called finite state automata.

(A) type 0
(B) type 1
(C) type 2
(D) type 3

💬 Discuss

✅ Correct Answer: (D) type 3

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

817

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

82%

Success Rate