Homework set 1 with solutions
February 22, 2010
1
1
Some DFAs (C)
1. L1 consists of all strings that start with ab. 2. L2 consists of all strings that contain cca. 3. L3 consists of all strings that contain at least 3 b's (not necessarily consecutive) 4.
Homework set 2 with solutions
February 6, 2010
1
1
Excluding the empty string (C)
Prove that if a language L is regular, then so is L = L \ cfw_. Solution: The language L = cfw_ is obviously regular (it's finite). Therefore, its complement is also regular
Homework set 1
January 31, 2010
Notes
This homework set covers Sections 1.1 and 1.2. (DFAs and NFAs) Due date: 2/22 (before the beginning of class) Submit your solutions by email. Exercises have letter grades indicating their difficulty (C=easy, A=hard)
Homework set 3 with solutions
March 29, 2010
1
1
Context-Free grammars (C)
The language of strings of the form an bk an where n is any natural number and k is a multiple of 3 The language of strings of the form a2n bn where n is any natural number Soluti
Homework set 5 with solutions
May 10, 2010
1
1
Understanding the definitions (C)
Assume that we are given two decision problems A and B. Here are some statements regarding these two problems: a A is in P b A is in NP c A is NP-complete d B is in P e B is
Homework set 4
April 9, 2010
Notes
This homework set covers Chapters 3,4 (Turing machines and decidability) Due date: 4/26 (before the beginning of class) Submit your solutions by email. Exercises have letter grades indicating their difficulty (C=easy, A
Homework set 2
February 6, 2010
Notes
This homework set covers Chapter 1 (regular languages) Due date: 3/1 (before the beginning of class) Submit your solutions by email. Exercises have letter grades indicating their difficulty (C=easy, A=hard) The speci
Homework set 3
March 13, 2010
Notes
This homework set covers Chapter 2 (CF languages) Due date: 3/24 (before the beginning of class) Submit your solutions by email. Exercises have letter grades indicating their difficulty (C=easy, A=hard) The special ans
Homework set 5
May 2, 2010
Notes
This homework set covers Chapter 7 (Complexity, P and NP) Due date: 5/10 (before the beginning of class) Submit your solutions by email. Exercises have letter grades indicating their difficulty (C=easy, A=hard) The specia
Homework set 4 with solutions
April 9, 2010
1
Figure 1: Turing machines for problem 1.
1
Turing machine basics (C)
As you know, we usually shy away from giving full low-level descriptions of Turing machines, because this requires a lot of effort. Instead,