Lecture 7

Learning objectives

After this class, you should be able to:

1. Define regular expressions and a language associated with a regular expression.
2. Given a regular expression, describe the language it accepts and given an NFA for it.
3. Given the description of a language or a DFA, give a regular expression for it.
4. Prove that regular expressions are equivalent to regular languages.

Reading assignment

1. Sections 3.1, 3.2.
2. Lecture 7 slides on Blackboard.
3. Definition 3.3, page 89.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Section 3.1, exercise #4.
  2. Section 3.1, exercise #8.
  3. Section 3.1, exercise #17 a, b.
  4. Section 3.2, exercise #1.
  5. Section 3.2, exercise #10 a.

• Questions on next lecture's material
  1. Give a right linear grammar for the language described in section 3.1, exercise #4.

---

Last modified: 29 Dec 2013