## Introduction to CS Theory VCSS-380 Spring 2009

### Assignment 1, due Monday, March 23, 2009

Solve the following exercises from your textbook. Be brief but precise.
1. Chapter 1, pages 32-42:
4bd, 6bd, 7bd, 8bd, 10, 13bd, 24a, 25bd, 28b, 35, 38, 40, 41, 47bd, 50, 62
2. Chapter 2, pages 72-81:
10 (use induction), 11 (use induction), 39bdf, 40bdf, 43 (use induction)

### Assignment 2, due Wednesday, April 1, 2009

Solve the following exercises from chapter 3 of your textbook.
1. Regular expressions: 1bc, 2bd, 3bcd, 8ac, 9efg, 15a, 16a
2. Finite automata: 17cd, 19efg, 20bdf, 33bcd, 43ce

### Assignment 3, due Monday, April 13, 2009 (to be handed in just before the midterm)

Solve the following exercises from your textbook.
1. Nondeterministic Automata (chapter 4, pages 156-164):
exercises 1bd, 2, 6, 7, 10ce, 13, 14, 15ab, 18b, 29a, 35a, and 38bc
(in 38 use the fixed point theorem method or the textbook approach, show work, don't just guess).
(note: these exercises are an excellent source of exam questions)

### Midterm Exam, Monday, April 13, 2009, noon-2pm, 70-1445

Usual class time and place

### Assignment 4, due Monday, May 4, 2009

Solve the following exercises from your textbook.
• Chapter 5, pages 191-193 (minimization and pumping): 1, 2, 3, 16bg, 17a, 20a, 24a.
• Chapter 6, pages 240-250 (context-free grammars): 1aceg, 4, 6, 9bdfh, 10b, 14, 18bd, 20, 22, 26bd.

### Assignment 5, due Thursday, May 14, 2009

Solve the following exercises from your textbook.
• Chapter 6, pages 240-250 (context-free grammars): 35ab, 39a, 40, 54, 58b.
• Chapter 7, pages 290-296 (pushdown automata): 2, 5ab (transition diagrams or tables), 6b, 13b (transition diagram or table).
• Chapter 8, pages 312-315 ((not)context-free languages): 1e, 5ace, 8ac, 14.

Back to the course page