9 citations · 13 across the 4 of their papers we have counts for
1 paper · 1 filter
Ehud Cseresnyes, Hannes Seiwert
We prove lower bounds on the length of regular expressions for finite languages by methods from arithmetic circuit complexity. First, we show a reduction: the length of a regular e…