ECS 120: Theory of Computation
UC Davis Phillip Rogaway
ps1
April 1, 2013
Problem Set 1 Due Friday, April 5, 2013
Instructions: Read the course-information sheet. Remember to acknowledge anyone with whom you
discussed problems. Recall too that homeworks a
ECS 120: Theory of Computation
UC Davis Phillip Rogaway
PS #9
May 24, 2013
Problem Set 9 Due Wednesday, June 5
Turn this in by 2:45 pm in the box in Kemper, or by 3:10 pm in discussion section.
Problem 1. Recall our C program that printed itself:
char*f="
ECS 120: Theory of Computation
UC Davis Phillip Rogaway
ps8
May 17, 2013
Problem Set 8 Due Friday, May 24, 2013
If you liked working with a partner and want to do so again, you may, turning in one problem set per
group. I dont recommend groups of more tha
ECS 120: Theory of Computation
UC Davis Phillip Rogaway
ps7
May 10, 2013
Problem Set 7 Due Friday, May 17, 2013
For this problem set, please work in teams of 23 people. Submit one solution per
team.
Problem 1. Design a Turing machine that takes as input a
ECS 120: Theory of Computation
UC Davis Phillip Rogaway
ps4
April 19, 2013
Problem Set 4 Due Friday, April 26, 2013
Problem 1. Using the procedure shown in class, convert the following NFA into a regular expression
for the same language.
b
a
0
1
2
c
b,c
c
ECS 120: Theory of Computation
UC Davis Phillip Rogaway
ps5
April 26, 2013
Problem Set 5 Due Friday, May 3, 2013
Problem 1. Given an NFA M = (Q, , , q0 , F ), dene (M ) = cfw_x : (q0 , x) F . In clear
English, explain what is (M ). Then prove that L is re
ECS 120: Theory of Computation
UC Davis Phillip Rogaway
ps6
May 3, 2013
Problem Set 6 Due Friday, May 10, 2013
Problem 1. Using the pumping lemma, prove that L = cfw_bi #bi+1 : bi is i in binary, i 1 is not context
free.
Problem 2. Alice tries to prove th
ECS 120: Theory of Computation
UC Davis Phillip Rogaway
ps2
April 5, 2013
Problem Set 2 Due Friday, April 12, 2013
Problem 1 Draw a smallest DFA M1 for L1 = cfw_w cfw_a, b : |w| 1 (mod 3). Draw a smallest DFA
M2 for L2 = cfw_w cfw_a, b : w ends in aa. App
ECS 120: Theory of Computation
UC Davis Phillip Rogaway
ps3
April 19, 2013
Problem Set 3 Due Friday, April 19, 2013
Problem 1. For the following problems, do not simplify your work (except you should please not
indicate unreachable states in any DFA)show