The Complexity of Regular(-Like) Expressions

被引：0
|
作者：
Holzer, Markus [1 ]
Kutrib, Martin [1 ]
机构：
[1] Univ Giessen, Inst Informat, D-35392 Giessen, Germany
来源：
DEVELOPMENTS IN LANGUAGE THEORY | 2010年 / 6224卷
关键词：
EPSILON-FREE NFA; FINITE AUTOMATA; LOOP COMPLEXITY; BOUNDS; SIZE; DERIVATIVES; LANGUAGE; FOLLOW;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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 operations (built-in or not) into equivalent ordinary regular expressions.
引用
收藏
页码：16 / 30
页数：15
相关论文
共 50 条
  • [1] THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS
    Holzer, Markus
    Kutrib, Martin
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2011, 22 (07) : 1533 - 1548
  • [2] COMPLEXITY MEASURES FOR REGULAR EXPRESSIONS
    EHRENFEUCHT, A
    ZEIGER, P
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 12 (02) : 134 - 146
  • [3] Descriptional Complexity of Deterministic Regular Expressions
    Losemann, Katja
    Martens, Wim
    Niewerth, Matthias
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 643 - 654
  • [4] On the undecidability and descriptional complexity of synchronized regular expressions
    Xie, Jingnan
    Hunt, Harry B. B.
    ACTA INFORMATICA, 2023, 60 (03) : 257 - 278
  • [5] Tight Bounds on the Descriptional Complexity of Regular Expressions
    Gruber, Hermann
    Holzer, Markus
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2009, 5583 : 276 - 287
  • [6] On the undecidability and descriptional complexity of synchronized regular expressions
    Jingnan Xie
    Harry B. Hunt
    Acta Informatica, 2023, 60 : 257 - 278
  • [7] The Complexity of Regular Expressions and Property Paths in SPARQL
    Losemann, Katja
    Martens, Wim
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2013, 38 (04):
  • [8] THE COMPLEXITY OF AGGREGATES OVER EXTRACTIONS BY REGULAR EXPRESSIONS *
    Doleschal, Johannes
    Kimelfeld, Benny
    Martens, Wim
    LOGICAL METHODS IN COMPUTER SCIENCE, 2023, 19 (03) : 1 - 12
  • [9] Complexity of decision problems for simple regular expressions
    Martens, W
    Neven, R
    Schwentick, T
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS, 2004, 3153 : 889 - 900
  • [10] REGULAR-LIKE TREE EXPRESSIONS
    BARRERO, A
    THOMASON, MG
    GONZALEZ, RC
    INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1983, 12 (01): : 1 - 11
12345