Day14 - Click to edit Master subtitle style Turing Machines 5th Model A Linear Memory Machine Dec 2 © UCF(Charles E 22 Basic Description • We

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Click to edit Master subtitle style 10/4/11 Turing Machines 5th Model A Linear Memory Machine 10/4/11 Dec 2, © UCF (Charles E. 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. 10/4/11 Dec 2, © UCF (Charles E. 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...
View Full Document

This note was uploaded on 10/03/2011 for the course COT 5310 taught by Professor Staff during the Spring '08 term at University of Central Florida.

Page1 / 8

Day14 - Click to edit Master subtitle style Turing Machines 5th Model A Linear Memory Machine Dec 2 © UCF(Charles E 22 Basic Description • We

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online