Tight Bounds on the Descriptional Complexity of Regular Expressions

被引：0

作者：

Gruber, Hermann ^{[1
]}

Holzer, Markus ^{[1
]}

机构：

[1] Univ Giessen, Inst Informat, D-35392 Giessen, Germany

来源：

DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS | 2009年 / 5583卷

关键词：

STAR HEIGHT;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite automata to regular expressions, study the effect of the complementation operation on the descriptional complexity of regular expressions, and the conversion of regular expressions extended by adding intersection or interleaving to ordinary regular expressions. Almost all obtained lower bounds are optimal, and the presented examples are over a binary alphabet, which is best possible.

引用

页码：276 / 287

页数：12

共 50 条

[1] Descriptional Complexity of Deterministic Regular Expressions
Losemann, Katja
Martens, Wim
Niewerth, Matthias
[J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 643 - 654
[2] On the undecidability and descriptional complexity of synchronized regular expressions
Xie, Jingnan
Hunt, Harry B. B.
[J]. ACTA INFORMATICA, 2023, 60 (03) : 257 - 278
[3] On the undecidability and descriptional complexity of synchronized regular expressions
Jingnan Xie
Harry B. Hunt
[J]. Acta Informatica, 2023, 60 : 257 - 278
[4] Closure properties and descriptional complexity of deterministic regular expressions
Losemann, Katja
Martens, Wim
Niewerth, Matthias
[J]. THEORETICAL COMPUTER SCIENCE, 2016, 627 : 54 - 70
[5] From Finite Automata to Regular Expressions and Back - A Summary on Descriptional Complexity
Gruber, Hermann
Holzer, Markus
[J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (08) : 1009 - 1040
[6] From Finite Automata to Regular Expressions and Back-A Summary on Descriptional Complexity
Gruber, Hermann
Holzer, Markus
[J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (151): : 25 - 48
[7] Concatenation of Regular Languages and Descriptional Complexity
Jiraskova, Galina
[J]. THEORY OF COMPUTING SYSTEMS, 2011, 49 (02) : 306 - 318
[8] Concatenation of Regular Languages and Descriptional Complexity
Jiraskova, Galina
[J]. COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2009, 5675 : 203 - 214
[9] Concatenation of Regular Languages and Descriptional Complexity
Galina Jirásková
[J]. Theory of Computing Systems, 2011, 49 : 306 - 318
[10] Descriptional Complexity of Winning Sets of Regular Languages
Marcus, Pierre
Torma, Ilkka
[J]. DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2020, 2020, 12442 : 130 - 141

← 1 2 3 4 5 →