hw4-1 - CSE105: Automata and Computability Theory Winter...

Info iconThis preview shows page 1. Sign up to view the full content.

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

Unformatted text preview: CSE105: Automata and Computability Theory Winter 2011 Homework #4 Due: Thursday, February 17th, 2011 Problem 1 Explain how you would design a Turing machine deciding the language L = 1 p p is prime . You do not need to give the state diagram for your machine, but you should give sufficient detail that (given enough patience!) one could write down the state diagram based on your description. (For examples of the right level of detail, see the descriptions of the Turing machines in Examples 3.11 and 3.12 in Sipser.) Problem 2 The input to a Turing machine is always a string, but we will want to use Turing machines to reason not just about strings but about objects such as graphs, automata, grammars, and even other Turing machines. In order to do this, we will encode each object O that is the input to the Turing machine as a string h O i over the machines input alphabet ; the input to the Turing machine will consist of the object in encoded (i.e., string) form....
View Full Document

This note was uploaded on 08/31/2011 for the course CSE 105 taught by Professor Paturi during the Spring '99 term at UCSD.

Ask a homework question - tutors are online