Download presentation

Presentation is loading. Please wait.

Published byJordan Barge Modified over 10 years ago

1
Palindrome Example TM M = (, Q, ) =,, 0, 1 Q = {q start, q copy, q left, q test, q halt } 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.

2
Palindrome Example Figure 2 – Palindrome Example of a TM computation

3
Palindrome Example Figure 2 – Palindrome Example of a TM computation

4
Palindrome Example Figure 2 – Palindrome Example of a TM computation

5
Palindrome Example Figure 2 – Palindrome Example of a TM computation

6
Palindrome Example Figure 2 – Palindrome Example of a TM computation

7
Palindrome Example Figure 2 – Palindrome Example of a TM computation

8
Palindrome Example Figure 2 – Palindrome Example of a TM computation

9
Palindrome Example Figure 2 – Palindrome Example of a TM computation

10
Palindrome Example Figure 2 – Palindrome Example of a TM computation

11
Palindrome Example Figure 2 – Palindrome Example of a TM computation

12
Palindrome Example Figure 2 – Palindrome Example of a TM computation

Similar presentations

© 2024 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google