120 likes | 224 Views
Learn about a Turing Machine computation example showcasing how to determine if a given input is a palindrome. Explore the step-by-step process involved in verifying palindromes with this detailed illustration.
E N D
Palindrome Example • TM M = (G,Q, d ) • G = {►, □, 0, 1} • Q = {qstart, qcopy, qleft, qtest, qhalt} • x Î {0, 1}* • PAL(x) = 1 if x is a palindrome and 0 otherwise. That is, PAL(x) = 1 iff x reads the same from left to right and from right to left.
Palindrome Example Figure 2 – Palindrome Example of a TM computation
Palindrome Example Figure 2 – Palindrome Example of a TM computation
Palindrome Example Figure 2 – Palindrome Example of a TM computation
Palindrome Example Figure 2 – Palindrome Example of a TM computation
Palindrome Example Figure 2 – Palindrome Example of a TM computation
Palindrome Example Figure 2 – Palindrome Example of a TM computation
Palindrome Example Figure 2 – Palindrome Example of a TM computation
Palindrome Example Figure 2 – Palindrome Example of a TM computation
Palindrome Example Figure 2 – Palindrome Example of a TM computation
Palindrome Example Figure 2 – Palindrome Example of a TM computation
Palindrome Example Figure 2 – Palindrome Example of a TM computation