If nL can be recognized by a multitape TM with time complexity f, then L can be recognized by a one-tape machine with time complexity DSD
| A. | O( f 2) |
| B. | o( f 2) |
| C. | o(h) |
| D. | O(h2) |
Answer : A Explanation : Suindu De said: (2:57am on Saturday 20th January 2018)
n is a multiplier to that language so if f is the compleexity then f should nbe the complexity.
|
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
