CSCI 2670, Fall 2012

Introduction to Theory of Computing

Homework Assignment 2

Due Monday September 10, 2012

(All questions are from the textbook Michael Sipser, Introduction to the Theory of Computation, Second Edition, Thomson Course Technology. Students should submit their answers in class or to the instructor's office by 5:00pm on the due date.)

This homework assignment is about NFA and regular expressions.

  1. Question 1.13 on page 85. Note: please follow the suggestion in the book that you will construct a 4-state NFA for the complement of F before constructing a DFA of 5 states for F).

  2. Question 1.16 (a) on page 86. Also use a string of a's and b's to illustrate effectively your DFA simulation of an accepting path of the NFA on the string.

  3. Question 1.17 (a) on page 86.

  4. Question 1.17 (b) on page 86.

  5. Question 1.18 (j) on page 86.

  6. Question 1.18 (l) on page 86.

  7. Question 1.19 (b) on page 86.

  8. Question 1.20 (b) on page 86.

  9. Question 1.21 (b) on page 86

  10. Question 1.22 on page 87.