For each of the following pairs of regular languages, find a regular expression and an FA that each define L1 n L2. (Note: both a RE and an FA!) 3) L1 (b + ab)*(a + ?) L2 (a + b)*aa(a + b)* Regular...

For each of the following pairs of regular languages, find a regular expression and an FA that each define L1 n L2. (Note: both a RE and an FA!)
3) L1
(b + ab)*(a +

?)
L2
(a + b)*aa(a + b)*

Regular Expression for L1 n L2: null
FA for L1 n L2:
4) L1
All string of even length = (aa + ab + ba + bb)*

L2 b(a
+
b)*
Regular Expression for L1 n L2:
b(a + b)(aa + ab + ba + bb)*
(even length starting with b)
FA for L1 n L2:
5) L1
Odd-length strings
L2
a(a
+
b)*
Regular Expression for L1 n L2:
a(aa + ab + ba + bb)* (odd length, begins with a)

FA for L1 n L2:



For each of the following pairs of regular languages, find a regular expression and an FA that each define L1 ∩ L2. (Note: both a RE and an FA!) 3) L1 (b + ab)*(a + Λ) L2 (a + b)*aa(a + b)* Regular Expression for L1 ∩ L2: null FA for L1 ∩ L2: 4) L1 All string of even length = (aa + ab + ba + bb)* L2 b(a + b)* Regular Expression for L1 ∩ L2: b(a + b)(aa + ab + ba + bb)* (even length starting with b) FA for L1 ∩ L2: 5) L1 Odd-length strings L2 a(a + b)* Regular Expression for L1 ∩ L2: a(aa + ab + ba + bb)* (odd length, begins with a) FA for L1 ∩ L2: