2020
DOI: 10.1007/978-3-030-62536-8_3
|View full text |Cite
|
Sign up to set email alerts
|

Regular Expression Length via Arithmetic Formula Complexity

Abstract: 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 expression for a language L ⊆ {0, 1} n is bounded from below by the minimum size of a monotone arithmetic formula computing a polynomial that has L as its set of exponent vectors, viewing words as vectors. This result yields lower bounds for the binomial language of all words with exactly k ones and n−k zeros and for the language of a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 34 publications
(106 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?