Given regular expressions $R_1, \dots, R_n$, are there any non-trivial bounds on the size of the smallest context-free grammar for $R_1 \cap \cdots \cap R_n$?
Complexity of intersection of regular languages as context-free grammars
fl.formal languages;regular language;context free