ECS 120: Theory of Computation UC Davis Phillip Rogaway
Handout QS2 January 31, 2002
Quiz Solutions Section 2
1 Short Answer
(1) Draw a DFA that accepts L = cfw_x cfw_1, 2 : x has at least two 2s. Im too lazy to draw the diagram. (2) List the lexicographi
ECS 120: Theory of Computation UC Davis Phillip Rogaway
Handout QS1 January 31, 2002
Quiz Solutions Section 1
1 Short Answer
(1) Draw a DFA that accepts L = cfw_x cfw_1, 2 : x has exactly two 2s. Im too lazy to draw the diagram. (2) List the lexicographic
ECS 120: Theory of Computation
UC Davis Phillip Rogaway
Quiz #3S
October 27, 2012
Quiz 3 Solutions
Graded out of 28 points: problem 1 out of 8 points (2 points per answer); problem 2 out of 12 points
(+1 for each correct answer; 1 for each incorrect answe
ECS 120: Theory of Computation
UC Davis Phillip Rogaway
Quiz #2S
October 23, 2012
Quiz 2 Solutions
The quiz was graded out of 32: two points for each of the eleven ll-in-the-blank questions; 1 point for
each true/false (right answers +1, wrong or missing
ECS 120: Theory of Computation
UC Davis Phil Rogaway
Handout Quiz #2S
May 21, 2010
Quiz 2 Solutions
Instructors comments. The quiz was graded out of 75 points: 10 points for each of the rst ve problems,
and 25 points for the true/false. Those were graded
ECS 120: Theory of Computation
UC Davis | Phillip Rogaway
Handout Q2.S
February 8, 1999
Quiz 2 Solutions
0. Your NAME:
1. Carefully state the pumping lemma for regular languages.
If L is a regular language then there exits a number N such that for all s 2
ECS 120: Theory of Computation UC Davis Phil Rogaway
Handout Quiz #1S April 18, 2010
Quiz 1 Solutions
Questions 14 were graded out of 10 points; questions 513 were graded out of 25 points total; question 14 was graded out of 20 points. So the total possib
ECS 120: Introduction to the Theory of Computation
UC Davis | Phillip Rogaway
Handout N.1
October 18, 1995
The Pumping Lemma
De nition: Language L pumps if there exists a N such that for all s 2 L, jsj N , s can be
decomposed into s = xyz , jyj 1, such th
ECS 120: Theory of Computation
UC Davis Phillip Rogaway
ps8-soln
November 29, 2012
Problem Set 8 Solutions
Problem 1.1 Classify each of the following languages as either recursive, or r.e. but not not
co-r.e., or co-r.e. but not r.e., or neither r.e. nor
ECS 120: Theory of Computation
UC Davis Phillip Rogaway
ps3-soln
October 18, 2012
Problem Set 3 Solutions
Problem 1. For the following problems, do not simplify your work (except you should please not
indicate unreachable states in any DFA)show everything
ECS 120: Theory of Computation
UC Davis Phillip Rogaway
ps6-soln
November 8, 2012
Problem Set 6 Solutions
Problem 1. Using the pumping lemma, prove that L = cfw_bi #bi+1 : bi is i in binary, i 1 is not context
free.
Suppose for contradiction that L were c
ECS 120: Theory of Computation
UC Davis Phillip Rogaway
ps5-soln
November 1, 2012
Problem Set 5 Solutions
Problem 1. Formally specify both (a) a CFG and (b) a PDA for the language
L = cfw_x cfw_a, b, c : x contains an equal number of two dierent character
ECS 120: Theory of Computation
UC Davis Phillip Rogaway
ps4-soln
October 25, 2012
Problem Set 4 Solutions
Problem 1. Let be a regular expression of length n.
(a) Using procedures shown in class, if we convert into a regular expression such that L( ) = L()
6.045J/18.400J: Automata, Computability and Complexity
Prof. Nancy Lynch, Nati Srebro
Quiz 3: Solutions
April 28, 2004
Susan Hohenberger
Please write your name in the upper corner of each page.
Q3-Solutions-1
Name:
Problem 1: True, False, or Unknown (18 p
6.045J/18.400J: Automata, Computability and Complexity
Prof. Nancy Lynch, Nati Srebro
Quiz 2 Solutions
March 31, 2004
Susan Hohenberger
Please write your name in the upper corner of each page.
Q2: Solutions-1
Name:
Problem 1:
True or False (15 points). Fu
6.045J/18.400J: Automata, Computability and Complexity
Prof. Nancy Lynch
Quiz 1: Solutions
Nati Srebro, Susan Hohenberger
Please write your name in the upper corner of each page. (2 Points)
Q1-1
Problem 1:
True or False (18 points) Full credit will be giv
CS 373, Spring 2009. Mock midterm 1 (Based on rst midterm in CS 273, Fall 2008.)
INSTRUCTIONS (read carefully)
Fill in your name, netid, and discussion section time below. Also write your netid on the other pages (in case they get separated).
NAME: NETID
CS373, Fall 2011. Midterm 2
INSTRUCTIONS (read carefully)
Fill in your name, netid, and discussion section time below. Also write your netid on the other
pages (in case they get separated).
NAME:
NETID:
DISC:
There are 6 problems. Make sure you have a c
CS373, Fall 2011. Midterm 1
INSTRUCTIONS (read carefully)
Fill in your name, netid, and discussion section time below. Also write your netid on the other
pages (in case they get separated).
NAME:
NETID:
DISC:
There are 6 problems. Make sure you have a c
Midterm 2
CS 373: Theory of Computation
Date: Thursday, November 4, 2010.
Instructions:
This is a closed book exam. No notes, cheat sheets, textbook, or printed material allowed.
You have 120 minutes to solve this exam.
This exam has 5 problems each wo
Problem Set 1
Fall 11
Due: Tuesday, September 13th, in class, before class begins.
NOTE : Problem 6 is optional for EXTRA CREDIT. However, people who take the honor
section MUST solve this problem.
Please follow the homework format guidelines posted on th
Problem Set 1
Fall 11
Due: Tuesday, September 13th, in class, before class begins.
NOTE : Problem 6 is optional for EXTRA CREDIT. However, people who take the honor
section MUST solve this problem.
Please follow the homework format guidelines posted on th