Which of the following problems is decidable?
a. whether a turing machine ever leaves a particular cell it it scanning
b.whether a turing machine started on blank tape will ever halt
c. whether a turing machine accepts at least two strings
d. whether a turing machine accepts a finite set
The answer to the question is available in the PDF file https://assignmentexpert.com/https://assignmentexpert.com/homework-answers/mathematics-answer-38656.pdf
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