0 votes 0 votes Shankar Kakde asked Jan 9, 2019 Shankar Kakde 234 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Magma commented Jan 9, 2019 reply Follow Share D ) 0 votes 0 votes balchandar reddy san commented Jan 9, 2019 reply Follow Share Answer should be d.. given TM accepts {a^n | n>0, b^n | n>0}, the TM executes the i/p's and moves right on the tape without updating the input until it reaches end of the string. I would say it just works as a Finite Automata.. 0 votes 0 votes Kunal Kadian commented Jan 9, 2019 reply Follow Share D. Tape should contain either only a's or only b's. And there should be atleast 1 a or b. 0 votes 0 votes Please log in or register to add a comment.