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 条
  • [21] Regular expressions
    Scientific Computing and Instrumentation, 2000, 17 (08):
  • [22] From Finite Automata to Regular Expressions and Back-A Summary on Descriptional Complexity
    Gruber, Hermann
    Holzer, Markus
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (151): : 25 - 48
  • [23] Regular Transducer Expressions for Regular Transformations
    Dave, Vrunda
    Gastin, Paul
    Krishna, Shankara Narayanan
    LICS'18: PROCEEDINGS OF THE 33RD ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, 2018, : 315 - 324
  • [24] Regular transducer expressions for regular transformations
    Dave, Vrunda
    Gastin, Paul
    Krishna, Shankara Narayanan
    INFORMATION AND COMPUTATION, 2022, 282
  • [25] Synchronized regular expressions
    Della Penna, G
    Intrigila, B
    Tronci, E
    Zilli, MV
    ACTA INFORMATICA, 2003, 39 (01) : 31 - 70
  • [26] Forkable Regular Expressions
    Sulzmann, Martin
    Thiemann, Peter
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, LATA 2016, 2016, 9618 : 194 - 206
  • [27] Regular Expressions on the Web
    Hodovan, Renata
    Herczeg, Zoltan
    Kiss, Akos
    12TH IEEE INTERNATIONAL SYMPOSIUM ON WEB SYSTEMS EVOLUTION (WSE 2010), 2010, : 29 - 32
  • [28] Timed regular expressions
    Asarin, E
    Caspi, P
    Maler, O
    JOURNAL OF THE ACM, 2002, 49 (02) : 172 - 206
  • [29] A Play on Regular Expressions
    Fischer, Sebastian
    Huch, Frank
    Wilke, Thomas
    ICFP 2010: PROCEEDINGS OF THE 2010 ACM SIGPLAN INTERNATIONAL CONFERENCE ON FUNCTIONAL PROGRAMMING, 2010, : 357 - 368
  • [30] DERIVATIVES OF REGULAR EXPRESSIONS
    BRZOZOWSKI, JA
    JOURNAL OF THE ACM, 1964, 11 (04) : 481 - &
12345