Solve the following problems from our textbook (Maheshwari and Smid):
- Problem 2.14 Part 2
- Convert the DFA shown at the top of page 23 to a regular
expression, using the GNFA method.
- Problem 2.20, but you can use the Myhill-Nerode theorem, or the
pumping lemma, or closure properties of regular languages
- Problem 2.23
- Problem 2.24
- Problem 2.25
The deadline is October 18 at 23:59. Note that the homework box has
been changed to number 396 (still in front of room 403 in N1).