In DFA we can do the intersection of two automata by doing the cross product of the states of the two automata and accepting those states that are accepting in both the init
We can also use De Morgan's Laws: A intersection B = (A' U B')'
Taking the union of the compliments of the two NFA's is comparatively simpler, especially if you are used to the epsilon method of union.