hw8 - Spring 10: CSci 4011Formal Languages and Automata...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

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

Unformatted text preview: Spring 10: CSci 4011Formal Languages and Automata Theory 40 points Homework 8 Out Fri., 3/26 Due Fri., 4/2 Please review the instructions given with Homework 1, as they apply to this home- work, too. Please hand in your answers to the following. Note: All Exercise/Problem/Theorem/etc. numbers correspond to the U.S. 2nd edition of the Sipser text. If you have the International edition, please check that the numbers match the ones in the U.S. edition. 1. Describe a Turing Machine (TM) that decides the following language: { w | w { , 1 } * and is a palindrome } . Assume that the input string w is given in the first | w | cells of the tape, that the rest of the tape is blank initially, and that the read-write head is initially on the first cell. You may give your answer in words, at the level of detail shown in Examples 3.11 and 3.12 (p. 146 and p. 147). A state diagram is not required....
View Full Document

This note was uploaded on 10/21/2011 for the course CSCI 4011 taught by Professor Nadathur during the Spring '08 term at Minnesota.

Page1 / 3

hw8 - Spring 10: CSci 4011Formal Languages and Automata...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online