CSCI 2670, Fall 2012

Introduction to Theory of Computing

Homework Assignment 1

Due Monday August 27, 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 definitions and basic properties of finite automata.

  1. Question 1.3 on page 83.

  2. Question 1.6 (a) on page 84

  3. Question 1.6 (i) on page 84.

  4. Give the formal definition of a DFA for the state diagram you have drawn for Question 1.6 (i) on page 84.

  5. Question 1.7 (b) on page 84.

  6. Question 1.8 (a) on page 84.

  7. Question 1.9 (b) on page 85.

  8. Question 1.10 (a) on page 85

* All homework answers need to be word-processed or typed. Hand-writing only applies to graph or table drawings.