in Theory of Computation
324 views
0 votes
0 votes
How Finite automata is considered as Turing machine with a restricted tape length?
in Theory of Computation
324 views

1 Answer

1 vote
1 vote
Best answer
u cannot construct a finite automata that has infinite number of states and like turing machine it can move in both directions

from a particular stste u can go to the previous one or the next one

therefore its TM with finite tape
selected by