721 views
1 votes
1 votes
If in a turing machine we take away its ink so that it can not write on the input tape. Then it becomes __________

A) LBA

B) DPDA

C) DFA

D) 2DPDA

1 Answer

3 votes
3 votes
If a TM can't write on input tape then it has the same power as 2-DFA which can move both sides and furthermore can be proved that it has the same power as DFA

Related questions

3 votes
3 votes
1 answer
1
3 votes
3 votes
2 answers
2
3 votes
3 votes
2 answers
3
0 votes
0 votes
0 answers
4
Lone Wolf asked Aug 7, 2018
196 views
is it true that:-1) turing decidable languages are recursive languages.2) turing recognizable languages are recursive enumerable.