Q. A FSM can be considered, having finite tape length without rewinding capability and unidirectional tape movement

(A) Turing machine
(B) Pushdown automata
(C) Context free languages
(D) Regular languages

💬 Discuss

✅ Correct Answer: (A) Turing machine

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

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

174

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

89%

Success Rate