This preview shows page 1. Sign up to view the full content.
Unformatted text preview: L = a n b m a n + m : n ,m 1 (b) [9.1.8] L = { ww : w { a,b } + } . 2. [9.1.11(b)] Construct a Turing Machine (TM) that computes the following function where x and y are represented in unary. f ( x,y ) = xy if x > y and 0 otherwise. 3. Based on [9.2.3.d] Give pseudocode for a Turing machine that computes f ( n ) = n !, where n is represented in unary. 4. Show that the following two problems on Turing Machines are undecidable. (a) [12.2.2.(a)] L ( M ) contains any string of length ve. (b) [12.2.2.(b)] L ( M ) is regular. 1...
View
Full
Document
This note was uploaded on 12/04/2010 for the course CS 321 taught by Professor Staff during the Fall '08 term at Oregon State.
 Fall '08
 Staff

Click to edit the document details