For each of the following pairs of regular languages, find a regular expression and a Finite Automata (FA) that each define L1 intersection L2.
L1 L2
1. (f + e)e (f + e)* e(f + e)*
2. (d + c)*d c(d + c)*
3. All string of even length = (cc + cd + dc + dd)* (c + d)*d
4. Even-length strings c(c + d)*(c + d)*c
5. (c + dc)*(d + ^) (d + c)*dd(d + c)*
6. Demonstrate that the following FAs are equivalent (as in Chapter 11), or determine if they are not. Then,
7. Demonstrate that the following FAs are equivalent (as in Cohen Chapter 11), or determine if they are not.
8. Demonstrate that the following FAs are equivalent (as in Cohen Chpt 11), or determine if they are not.
9. Using the method of intersection each machine with the complement of the other, show that the following machines do not accept the same language.
10. By using blue paint, determine if the following FA accepts any words:
11. Again using blue paint, determine if the following FA accepts any words:
