1 votes 1 votes The language accepted by a Turing Machine if its Read/Write head is converted to a Read Only one is? Recursive but not necessarily context-free Deterministic context-free but not necessarily regular Regular None of the above Theory of Computation go2025-mix-3 identify-class-language turing-machine + – gatecse asked Oct 15, 2020 • recategorized Oct 15, 2020 by Lakshman Bhaiya gatecse 127 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes Without doing any writing to tape, the TM can only transition among the finite number of states. Its acceptance power reduces to that of a finite automata. Reference: https://en.wikipedia.org/wiki/Two-way_finite_automaton gatecse answered Oct 15, 2020 • selected Oct 9, 2021 by Arjun gatecse comment Share Follow See all 4 Comments See all 4 4 Comments reply Abhisheksmile94 commented Oct 19, 2020 reply Follow Share what about the tape length? if tape length is infinite still it will be FA ? 0 votes 0 votes gatecse commented Oct 19, 2020 reply Follow Share Who called it a finite automata? We only said the language accepted will be regular. It means the machine cannot accept any non regular language. 0 votes 0 votes Abhisheksmile94 commented Oct 20, 2020 reply Follow Share if language is regular it must have FA right ? 0 votes 0 votes himanshu2021 commented Jan 14, 2021 reply Follow Share @Abhisheksmile94 FA accepts only a Regular language. But a Regular language can be accepted by other machines also, like PDA, LBA, HTM, TM. 1 votes 1 votes Please log in or register to add a comment.