This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSE 105: Introduction to the Theory of Comptuation Fall 2010 Problem Set 5 Instructor: Daniele Micciancio Due on: Wed. Nov 10, 2010 Problem 1 Let BIGGER be the set of all strings over the alphabet { , 1 ,> } of the form x > y , where x and y are binary numbers such that x is bigger than y . The following deterministic Turing machine decides the language BIGGER (where the empty string is interpreted as a representation of the number 0): This is just possible solution. The problem can be solved in many different ways. Problem 2 The textbook defines Turing machines as finite state automata with a read/write tape that extends indef initely to the right. If the Turing machine attempts to move beyond the left hand boundary of the tape, the tape head simply stays in its current position. JFLAP allows a seemingly more powerful type of Turing machine, whose tape in unbounded both to the left and to the right, and if the machine attepts to move beyond the left margin, a new blank cell is created to allow moving left. In this problem you are asked tobeyond the left margin, a new blank cell is created to allow moving left....
View
Full Document
 Fall '99
 Paturi
 Random access machine, Transition function, universal Turing machine, extended Turing machine, Theory of Comptuation

Click to edit the document details