HW10
Problem 1
1. While head1 and head2 read S, move head1 and head2 right.
2. If head1 or head2 reads S, then move head2 left to the first symbol
before t, move head1 right to the first S after a comma, and goto 1.
3. While head1 and head3 read A, move h
CSE 105: Introduction to the Theory of Computation, Winter 2003
Solutions to Problem Set 3
A. Hevia and J. Mao
March 7, 2003
Solutions to Problem Set 3
3.2 This concerns the Turing machine M1 whose description and state diagram appears in Example
3.5 on t
Computer Science and Engineering, UCSD
CSE 105: Introduction to the Theory of Computation
Problem Set 3 Solutions
Spring 04
Instructor: Mihir Bellare
May 20, 2004
Problem Set 3 Solutions
Problem 1 Exercise 3.5, page 148 of the text.
The key to the solutio
902 43500 HOMEWORK 3
due Tuesday, November 16, 2010
All problems are in the book: Michael Sipser, Introduction to the Theory of
Computation, 2nd Edition, PAWS Publishing Company, 2005.
Solution by Cheng-Chung Li
Problem 1
a. Use the languages A = cfw_am b
Limits of Computation: Homework 1 solutions
Kevin Matulef
January 31th, 2001
Problem 1
Design a TM that decides the language cfw_0n 1n |n 0
= cfw_0, 1
= cfw_0, 1,
Q = cfw_q0 , q1 , q2 , q3 , qa , qr
q0 = the start state
qa = the accept state
qr =
CSE 105: Introduction to the Theory of Computation, Winter 2003
Solutions to Problem Set 3
A. Hevia and J. Mao
March 7, 2003
Solutions to Problem Set 3
3.2 This concerns the Turing machine M1 whose description and state diagram appears in Example
3.5 on t