Given two languages L1 and L2, how to calculate L1\L2

585 Views Asked by At

I have a problem with my paper recently. For a given language $L_1$, which is generated by a deterministic finite automaton(DFA) $G$. For another language $L_2$, which is generated by an nondeterministic finite automaton(NFA) $H$. How can I calculate language $L_1\setminus L_2$ based on these two automata? One way I can find is to translate $H$ into a DFA, say $H'$. Then I can construct a new DFA which recognizes $L_1\setminus L_2$ base on $G$ and $H'$. However, the state complexity of NFA to DFA is exponential. I want to know if this problem can be solved with less state complexity. (Sorry for my poor English).