{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

hw10soln - CS 301 Homework 10 Due Tuesday November 10(start...

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

View Full Document Right Arrow Icon
CS 301 - Homework 10 Due Tuesday, November 10 (start of lecture) Chapter 9 1. Consider the following Turing machine M : q 0 q 1 q 2 q 3 q 4 q 5 a, a, R a, a, R b, b, R b, b, R a, a, L b, b, L , , L , , R (a) Give the computation path trace for initial configuration q 0 abab . q 0 abab aq 1 bab abq 2 ab abaq 2 b ababq 3 abaq 4 b abq 4 ab aq 4 bab q 4 abab q 4 abab q 5 abab (b) Give the computation path trace for initial configuration q 0 abba . q 0 abba aq 1 bba abq 2 ba abbq 3 a (c) Give a regular expression for L ( M ). aba * b Chapter 10.1 1. Problem 4a,b (page 257) solution in book 2. Study example 9.7 starting on page 230. This gives the program for a Turing machine that accepts the language L = { a n b n : n 1 } . The machine basically operates by attempting to transform a string a n b n on the tape into a string x n y n while keeping track of the matching a x , b y transformations. (a) How many moves does it take to accept a string a n b n as a function of n ?
Background image of page 1

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

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

{[ snackBarMessage ]}