Computer Science · Theory of Computation
Which of the following languages represents the output accepted by a Turing machine with the given transition function (δ)? δ(q0, a) = (q1, x, R) δ(q1, a) = (q1, a, R) δ(q1, y) = (q1, y, R) δ(q1, b) = (q2, y, L) δ(q2, y) = (q2, y, L) δ(q2, a) = (q2, a, L) δ(q2, x) = (q0, x, R) δ(q0, y) = (q3, y, R) δ(q3, y) = (q3, y, R) δ(q3, □) = (qf, □, R)
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1L = {anbn | n > 1}
- 2L = {anbn | n > 0}
- 3L = {anbn | n ≥ 1}✓
- 4L = {anbn | n ≥ 0}
Correct answer
L = {anbn | n ≥ 1}
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Theory of Computation MCQs →Want more practice questions on Theory of Computation?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Theory of Computation