===========================================================================
CSC 236               Tutorial Exercises for Week 12              Fall 2007
===========================================================================

Consider the following language.

    L = { s in {0,1}* : the third-last symbol of s is a 1 }

A.  Give a RE for L.

B.  Construct a NFA for L.

C.  Construct a DFA equivalent to your NFA from Question A, using the
    subset construction.  (See if you can simplify the resulting DFA.)

D.  Construct a RE equivalent to your DFA from part C, using the state
    elimination construction.  (See if you can simplify the resulting RE
    using equivalences from class.)