CS 481 Automata, Winter 1998, HW #2
Due: 28 January, 1997 (Wednesday)


Consider the following languages over the alphabet {a,b}.

L1 = { w | w has the same first and last symbols}
L2 = { w | length of w is even}

Construct DFA's for the following languages:

(1) L1 U L2
(2) L1.L2
(3) L1*

FOR GRADUATE CREDIT

(4) L2.L1
(5) L2*

Use the algorithms discussed in the class/text. 

For (1), use the Prolog programs provided for various conversions 
(rmet.pro and ntd.pro) and submit session results.