{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

day14 - Turing Machines 5th Model Click to edit Master...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Click to edit Master subtitle style 10/4/11 Turing Machines 5th Model A Linear Memory Machine
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
10/4/11 Dec 2, 2007/COT5310 © UCF (Charles E. Hughes) 22 Basic Description We will use a simplified form that is a variant of Post’s and Turing’s models. Here, each machine is represented by a finite set of states of states Q, the simple alphabet {0,1}, where 0 is the blank symbol, and each state transition is defined by a 4-tuple of form q a X s where q a is the discriminant based on current state q, scanned symbol a; X can be one of {R, L, 0, 1}, signifying move right, move left, print 0, or print 1; and s is the new state. Limiting the alphabet to {0,1} is not really a limitation. We can represent a k-letter alphabet by encoding the j-th letter via j 1’s in succession. A 0 ends each letter, and two 0’s ends a word.
Background image of page 2
10/4/11 Dec 2, 2007/COT5310 © UCF (Charles E. Hughes) 33 Base Machines R -- move right over any scanned symbol L -- move left over any scanned symbol 0 -- write a 0 in current scanned square
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}