316 views

1 Answer

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
selected by

Related questions

0 votes
0 votes
0 answers
1
2 votes
2 votes
1 answer
3
Nishu asked Mar 13, 2016
1,167 views
Time taken by one tape TM to simulate n moves of k-tape TM isa) O(n)b) O(n^k)c) O(n^2)d) none of these