Which of the following problems is decidable?
a. whether the tape alphabet has at least two symbols
b. whether a turing machine with 12 tapes will accept an infinite set
c. for ever string w the turing machine accepts it also accepts w^R.
d. whether a turing machine will ever print three consecutive 1′s
Comments
Dear Sujata Roy You're welcome. We are glad to be helpful. If you really liked our service please press like-button beside answer field. Thank you!
THANK YOU.
Leave a comment