Homework7 - L = a n b m a n + m : n ,m 1 (b) [9.1.8] L = {...

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

View Full Document Right Arrow Icon
Homework 7 CS 321 Due Date: 12/3/10, 2 PM Note: The homeworks should be your own work. You can discuss the homeworks orally with your peers, however. You should not use any web sources for this assignment. Please see the TA and the instructor during the oFce hours to get more help. ¡b¿ Important: ¡/b¿ It is important to summarize how the Turing Machines work in English comments because otherwise it is diFcult to understand them. It is a good idea to start with an algorithm description in English. 1. Construct a Turing Machine (TM) that will accept the following languages. (a) [9.1.7(f)]
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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 ) = x-y 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.

Ask a homework question - tutors are online