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 条
  • [41] On Extended Regular Expressions
    Carle, Benjamin
    Narendran, Paliath
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 279 - 289
  • [42] Regular expressions of conditions
    Popa, Emil Marin
    3RD INT CONF ON CYBERNETICS AND INFORMATION TECHNOLOGIES, SYSTEMS, AND APPLICAT/4TH INT CONF ON COMPUTING, COMMUNICATIONS AND CONTROL TECHNOLOGIES, VOL 3, 2006, : 174 - 176
  • [43] Regular Expressions with Lookahead
    Berglund, Martin
    van Der Merwe, Brink
    van Litsenborgh, Steyn
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2021, 27 (04) : 324 - 340
  • [44] Probabilistic ω-Regular Expressions
    Weidner, Thomas
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014), 2014, 8370 : 588 - 600
  • [45] Rewriting of regular expressions and regular path queries
    Calvanese, D
    De Giacomo, G
    Lenzerini, M
    Vardi, MY
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2002, 64 (03) : 443 - 465
  • [46] Regular binoid expressions and regular binoid languages
    Hashiguchi, K
    Wada, Y
    Jimbo, S
    THEORETICAL COMPUTER SCIENCE, 2003, 304 (1-3) : 291 - 313
  • [47] On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions
    Bozzelli, Laura
    Peron, Adriano
    Molinari, Alberto
    Montanari, Angelo
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2017, (256): : 31 - 45
  • [48] Modelling the semantics of calendar expressions as extended regular expressions
    Niemi, Jyrki
    Carlson, Lauri
    FINITE-STATE METHODS AND NATURAL LANGUAGE PROCESSING, 2006, 4002 : 179 - +
  • [49] The generalized regular expressions of conditions
    Popa, Emil Marin
    5th RoEduNet IEEE International Conference, Proceedings, 2006, : 272 - 274
  • [50] ADDING REGULAR EXPRESSIONS TO PASCAL
    SHARPE, D
    SIGPLAN NOTICES, 1988, 23 (12): : 125 - 133
12345