CS311 Quiz #4 ........ YourName_________________________

#1.

For the displayed FA, fill in the tables to construct a regular expression for the language accepted.
Notice that 2 is NOT accepting!

      p     r(p,1,0)       r(p,2,0)
   --------------------------------
      1
   --------------------------------
      2
   --------------------------------

      p      r(p,1,1)      r(p,2,1)
   --------------------------------
      1
   --------------------------------
      2
   --------------------------------

      p      r(p,1,2)      r(p,2,2)
   --------------------------------
      1
   --------------------------------
      2
   --------------------------------

       r = net regular expression = ___________________________

#2

For the language L accepted by the FA in #1, draw FAs for

(a) LL
(b) L*
(c) L ∪ L (think about this before drawing!)