HW #3: REGULAR EXPRESSIONS AND FINITE-STATE AUTOMATA
(corrected version)

1. #2.1 a, b, c, d

2. #2.6

3. (a) Implement the NDFSA of Fig. 2.27 as a TN.

   (b) Run it to determine which of the following expressions are accepted by it:

   a
   ab
   aba
   abb
   abab
   abaab
   ababa
   abaaba
   ababab
   

   (c) #2.8

   DUE: MONDAY, FEBRUARY 7

   
   

   ---

   Copyright © 2000 by William J. Rapaport (rapaport@cse.buffalo.edu)
   file: 675w/hw3.03fb00.html