84) If L can be recognized by a TM T with a doubly infinite tape, and τt = f, then L can be recognized by an ordinary TM with time complexity
Answer is:
O(f)
Related Theory of Computation MCQ with Answers
Answer is:
both 1) 1 stack is more powerful than an FSM with no stack and 2) 2 stacks is more powerful than a FSM with 1 stack
Answer is: