Give a state transition diagram of DFA that recognizes the following language over the alphabet {x,y}

L1 = The set of all strings that start with x and have odd length

L2 = The set of strings that start with y and have even length

L3 = The set of all strings that end with x and have even length

Draw DFA diagram for

(1) L1 L3

(2) L1 L2

(3) L2 L3

Transcribed image text