October 5

October 5 - construction October 5, 2005 6 Equivalent...

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

View Full Document Right Arrow Icon
CSCI 2670 Introduction to Theory of Computing October 5, 2005
Background image of page 1

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

View Full DocumentRight Arrow Icon
October 5, 2005 2 Quiz (6 points) Describe a Turing machine that accepts the following language {a n b m | n > 0 and m = n – 1} (4 points) Demonstrate how your Turing machine would calculate the string aaabb
Background image of page 2
October 5, 2005 3 Variants of Turing machines Robustness of model Varying the model does not change the power Example, making finite automata nondeterministic Simple variant of TM model Add “stay put” direction Other variants More tapes Nondeterministic
Background image of page 3

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

View Full DocumentRight Arrow Icon
October 5, 2005 4 Multitape Turing machines Same as standard Turing machine, but have several tapes TM definition changes only in definition of δ δ : Q × Г k Q × Г k × {L,R} k
Background image of page 4
October 5, 2005 5 Equivalence of machines Theorem: Every multitape Turing machine has an equivalent single tape Turing machine Proof method:
Background image of page 5

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

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7

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

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: construction October 5, 2005 6 Equivalent machines M 0 1 ~ ~ ~ ~ ~ ~ a a a ~ ~ ~ ~ ~ a b ~ ~ ~ ~ ~ ~ # 1 # a a a # a b # ~ ~ S October 5, 2005 7 Simulating k-tape behavior Single tape start string is #w#~ #...#~ # Each move proceeds as follows: Start at leftmost slot Scan right to (k+1) st # to find symbol at each virtual tape head Make second pass making updates indicated by k-tape transition function When a virtual head moves onto a #, shift string to right October 5, 2005 8 Corollary Corollary: A language is Turing-recognizable if and only if some multitape Turing machine recognizes it. October 5, 2005 9 Example Using 2-tape Turing machine, write a copy machine Copy tape 1 to tape 2 Move tape 1 to beginning Copy tape 1 to tape 2 Accept...
View Full Document

Page1 / 9

October 5 - construction October 5, 2005 6 Equivalent...

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

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