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 条
12345