B where the size of the compiled DFAs are
n respectively, what is the upper bound on the size of the compile DFA for
A|B? It shouldn't be hard to show that it can't be more than
n*m but can a lower upper bound be shown?
What about other related case:
- What is the expected case for real world examples? Is it less than
- What about the three part case with