Multiple Choice
What is the reason behind a Turing machine is more powerful than finite state machine FSM?
A) turing machine head movement is continued to one direction.
B) turing machine head moment is in both directions i.e. left moment and right moment as well.
C) turing machine has capability remember arbitrary long sequence of input string.
D) all are correct.
Correct Answer:
Verified
Correct Answer:
Verified
Q9: Given S = {a, b}, which one
Q10: He difference between a read-only Turing machine
Q11: In which of the stated below is
Q12: Choose the correct statement<br>A)recursive set ? recursive
Q13: The set which is not countable if
Q15: The number of symbols necessary to simulate
Q16: If a Turing machine halts for each
Q17: Which of the following statement is wrong?<br>A)power
Q18: A pushdown automata behaves like a Turing
Q19: Church's Thesis supports<br>A)a turing machine as a