CS 201 Homeworks
o HW 1(in postscript)/(in pdf) -- Quiz on 9/11, due on 9/13

Practice problem solutions(in postscript)/(in pdf)
Submitted problem solutions(in postscript)/(in pdf)

o HW 2(in postscript)/(in pdf) -- Quiz on 9/18, due on 9/20

Practice problem solutions(in postscript)/(in pdf)
Submitted problem solutions(in postscript)/(in pdf)

o HW 3(in postscript)/(in pdf) -- Quiz on 9/25, due on 9/27

Practice problem solutions(in postscript)/(in pdf)
Submitted problem solutions(in postscript)/(in pdf)

o HW 4(in postscript)/(in pdf) -- Quiz on 10/9 (make-up on 10/10 or 10/11), due on 10/11

Practice problem solutions(in postscript)/(in pdf)
Submitted problem solutions(in postscript)/(in pdf)

o HW 5(in postscript)/(in pdf) -- Quiz on 10/16, due on 10/18

Practice problem solutions(in postscript)/(in pdf)
Submitted problem solutions(in postscript)/(in pdf)

o HW 6(in postscript)/(in pdf) -- Quiz on 10/23, due on 10/25

Practice problem solutions(in postscript)/(in pdf)
Submitted problem solutions(in postscript)/(in pdf)

o HW 7(in postscript)/(in pdf) -- Quiz on 11/6, due on 11/8

Practice problem solutions(in postscript)/(in pdf)
Submitted problem solutions(in postscript)/(in pdf)

o HW 8(in postscript)/(in pdf) -- Quiz on 11/13, due on 11/15

Practice problem solutions(in postscript)/(in pdf)
Submitted problem solutions(in postscript)/(in pdf)

o HW 9(in postscript)/(in pdf) -- Quiz on 11/27, due on 11/29

Practice problem solutions(in postscript)/(in pdf)
Submitted problem solutions(in postscript)/(in pdf)

o HW 10(in postscript)/(in pdf) -- Quiz on 12/4, due on 12/6

Practice problem solutions(in postscript)/(in pdf)
Submitted problem solutions(in postscript)/(in pdf)

o Practice Excercises for the Final (in postscript)/(in pdf)

Problem 1: What is the language recongized by the following DFAs?
1a.
1a solution

1b
1b solution

Problem 2: For each of the following languages, either give a DFA that recognizes the language (i.e. a DFA M, such that L(M) is the desired language) or prove that no DFA can recognize the language. All languages are defined over the set of all bit strings.

2a: Let L1 consist of strings that have an even number of 1s and an odd number of 0s. 2a solution

2b: Let L2 consist of strings in which there are never two consecutive 0s and there are never two consecutive 1s. 2b solution

2c: Let L3 consist of strings that has exactly 3 times as many 0s has it has 1s. 2c solution

Problem 3:
3a: Write a grammar G such that L(G) = {0^n 1^2n | n >= 0} where 0^n denotes a sequence of n zeros and 1^{2n} denotes a sequence of 2n ones.

3a solution

3b: Could L(G) be expressed by a regular (type 3) grammar? 3b solution

Problem 4: What is the language generated by the grammar with productions S -> 10A, A -> 00A, A -> lambda where T = {0,1} and S is the start symbol.
4 solution

Don't forget about the frequently asked questions page.

Return to the CS201 Home Page