Succinctness of regular expressions with interleaving, intersection and counting

Wouter Gelade
2010 Theoretical Computer Science  
In this paper, we study the succinctness of regular expressions (REs) extended with interleaving, intersection and counting operators. We show that in a translation from REs with interleaving to standard regular expressions a double exponential size increase cannot be avoided. We also consider the complexity of translations to finite automata. We give a tight exponential lower bound on the translation of REs with intersection to NFAs, and, for each of the three classes of REs, we show that in a
more » ... translation to a DFA a double exponential size increase cannot be avoided. Together with known results, this gives a complete picture of the complexity of translating REs extended with interleaving, intersection or counting into (standard) regular expressions, NFAs, and DFAs.
doi:10.1016/j.tcs.2010.04.036 fatcat:2h23alsmifgwxpogyybrrso65a