Download presentation

Presentation is loading. Please wait.

Published byJordan Barge Modified over 3 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

OK

1 Turing machines Chapter 4, Smith and Kimber. A Turing machine is an abstraction of a human “computer”. Consists of - control, in the form of states -

1 Turing machines Chapter 4, Smith and Kimber. A Turing machine is an abstraction of a human “computer”. Consists of - control, in the form of states -

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on reflection in java Ppt on phonetic transcription to english Ppt on human chromosomes chart Ppt on student information system Ppt on formation of company Ppt on sub soil investigation report Ppt on elections in india download Ppt on sea level rise chart Ppt on channels of distribution of a product Ppt on synthesis and degradation of purines and pyrimidines a g