2011
DOI: 10.1142/s0129054111008866
|View full text |Cite
|
Sign up to set email alerts
|

The Complexity of Regular(-Like) Expressions

Abstract: We summarize results on the complexity of regular(-like) expressions and tour a fragment of the literature. In particular we focus on the descriptional complexity of the conversion of regular expressions to equivalent finite automata and vice versa, to the computational complexity of problems on regular-like expressions such as, e.g., membership, inequivalence, and non-emptiness of complement, and finally on the operation problem measuring the required size for transforming expressions with additional language… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 10 publications
(1 citation statement)
references
References 49 publications
0
1
0
Order By: Relevance
“…Remark 6. Lemma 6.1 still holds if we extend regular expressions by a squaring operation ( 2 ) defined by L(R 2 ) := (L(R)) 2 as introduced in [35]; see also [36] for a more recent overview. To show this, proceed analogously to the case when R is a concatenation of two identical subexpressions R = R ′ • R ′ .…”
Section: Definition 61 (Log-product) a Homogeneous Expressionmentioning
confidence: 93%
“…Remark 6. Lemma 6.1 still holds if we extend regular expressions by a squaring operation ( 2 ) defined by L(R 2 ) := (L(R)) 2 as introduced in [35]; see also [36] for a more recent overview. To show this, proceed analogously to the case when R is a concatenation of two identical subexpressions R = R ′ • R ′ .…”
Section: Definition 61 (Log-product) a Homogeneous Expressionmentioning
confidence: 93%