Multiple Choice
Which statement is true?
A) The tape of turing machine is infinite.
B) The tape of turing machine is finite.
C) The tape of turing machine is infinite when the language is regular
D) The tape of turing machine is finite when the language is nonregular.
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q2: In FA, if one enters in a
Q3: The symbols that can't be replaced by
Q4: Let n be the positive integer constant
Q5: Which of the following statement is false
Q6: Consider a stack, which is limited to
Q7: Which of the following will be used
Q8: State table of an FSM is given
Q9: Which of the following instances of the
Q10: Left hand side of a production in
Q11: Consider a graph G = (V, E)