Q. Any given transition graph has an equivalent:

(A) regular
(B) DFSM (Deterministic Finite State Machine)
(C) NDFSM
(D) All of them

💬 Discuss

✅ Correct Answer: (D) All of them

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

👁️

504

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

83%

Success Rate