304_HW7_F11 - following language: }*} , { , | { 1 b a u w...

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

View Full Document Right Arrow Icon
UML CS Foundations 91.304 (section 201) Fall, 2011 Homework Set #7 Assigned: Wednesday, 11/9 Due: Friday, 11/18 (start of lecture) This assignment covers textbook material in Chapter 3, Sections 3.2 – 3.3. Note: Refer to course web site for homework policies. Remember to attach signed honor statement. Note : Different printings or editions of the textbook may have different exercise numbering. Please note the textual problem descriptions below to resolve ambiguity. 1. (30 points) Nondeterministic Turing Machine Design: (Lewis & Papadimitriou) Give an implementation-level description of a nondeterministic Turing machine that recognizes the
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: following language: }*} , { , | { 1 b a u w uu ww L R R = 2. (40 points) Queue Automaton : Textbook Problem 3.14 on p. 161. 3. (30 points) Terminology for Describing Turing Machines : Extend textbook Example 3.23 for strongly connected directed graphs . Give both a high-level and implementation-level description of the Turing machine that decides the language: } graph directed connected strongly a is | { 2 G G L > < = As part of your answer, describe an appropriate encoding of G ....
View Full Document

This note was uploaded on 02/13/2012 for the course CS 91.304 taught by Professor Staff during the Fall '11 term at UMass Lowell.

Ask a homework question - tutors are online