Turing Machine transition table for checking a palindrome
Using a Turing machine. If the input tape of the machine consisted of a string of 0’s and 1’s, how would you approach the problem given that the output of the machine should be 1 or 0 respectively depending if it’s a palindrome or not.
Turning Machine transition table for checking a palindrome
Using a Turing machine. If the input tape of the machine consisted of a string of 0’s and 1’s, how would you approach the problem given that the output of the machine should be 1 or 0 respectively depending if it’s a palindrome or not.