Question 4:

Please Explain in detail step by step what you did and why.

Consider FA (2) that accepts language L2.

(a) Using the algorithm of Kleenes theorem, Lemma 3, Rule 3, construct an FA for the product language L2L2.

(b) Describe (in English phrases) the language L2L2 (the language accepted by your answer to part (a)).

(c) Give an example of a word of length at least 5 that is not in the language L2L2.

b Y2 X2 b 0 b Oo y a FA1 FA2