Palindromes & Turing Machine Project | Explore Language Implementation 🔍

Implemented Language: Palidrome Language Detail: The given Tm is for both even and odd length palindromes. In palindrome the first and last digit must be same. Basically, in this turing machine it will read the letter remembers it and compare it with the last letter. They both must not be same otherwise it will be rejected.In case of the even length palindrome, if you read the complete input without any mismatch then it will be accepted and declared as palindrome. If any mismatch occur the string is rejected.In case of the odd length palindrome, the machine compares the first and last digit, erase them and the process continues. The machine will match the letters. If all the letters match the machine continue to work. At the end, if all other inputs are matched and only one input letter left it will be erased and the string will be accepted. Instructor: http://niazilab.com/ Unity3D: http://niazilab.com/unity Website: https://sites.google.com/view/turing-machine-project/home