Reference no: EM13972561
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,
![1145_d1.png](https://secure.expertsmind.com/CMSImages/1145_d1.png)
7. Demonstrate that the following FAs are equivalent (as in Cohen Chapter 11), or determine if they are not.
![349_d2.png](https://secure.expertsmind.com/CMSImages/349_d2.png)
8. Demonstrate that the following FAs are equivalent (as in Cohen Chpt 11), or determine if they are not.
![1942_d3.png](https://secure.expertsmind.com/CMSImages/1942_d3.png)
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.
![956_d4.png](https://secure.expertsmind.com/CMSImages/956_d4.png)
10. By using blue paint, determine if the following FA accepts any words:
![649_d5.png](https://secure.expertsmind.com/CMSImages/649_d5.png)
11. Again using blue paint, determine if the following FA accepts any words:
![1248_d6.png](https://secure.expertsmind.com/CMSImages/1248_d6.png)