The language L = {anbnan n≥ 1} is recognized by

M

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Theory of Computation

Q. The language L = {anbnan n≥ 1} is recognized by

(A) turing machine
(B) 2 pushdown automata
(C) post machine
(D) all are correct

💬 Discuss

✅ Correct Answer: (D) all are correct

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

100

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

88%

Success Rate