0 votes 0 votes How Finite automata is considered as Turing machine with a restricted tape length? Theory of Computation turing-machine finite-automata + – adwaitLP asked Sep 11, 2017 adwaitLP 316 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes 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 A_i_$_h answered Sep 12, 2017 selected Sep 12, 2017 by adwaitLP A_i_$_h comment Share Follow See all 0 reply Please log in or register to add a comment.