Next move function δ of a Turing machine M = (Q, Σ , Γ, δ, q0, B, F) is a mapping
δ : Q x Σ --> Q x Γ
δ : Q x Γ ---> Q x Σ x {L, R}
δ : Q x Σ ---> Q x Γ x {L, R}
δ : Q x Γ ---> Q x Γ x {L, R}
Option: D
Explanation :
Click on Discuss to view users comments.
Write your comments here:
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
O(f)
o(f)
O(h)
o(h)
Option: A
Do not have an account? Register
