Sciweavers

WIA
2009
Springer

Short Regular Expressions from Finite Automata: Empirical Results

13 years 10 months ago
Short Regular Expressions from Finite Automata: Empirical Results
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of finding good elimination orderings for the state elimination algorithm, one of the most popular algorithms for the conversion of finite automata into equivalent regular expressions. Here we tackle this problem both from the theoretical and from the practical side. First we show that the problem of finding optimal elimination orderings can be used to estimate the cycle rank of the underlying automata. This gives good evidence that the problem under consideration is difficult, to a certain extent. Moreover, we conduct experiments on a large set of carefully chosen instances for five different strategies to choose elimination orderings, which are known from the literature. Perhaps the most surprising result is that a simple greedy heuristic by [M. Delgado, J. Morais: Approximation to the smallest regular exp...
Hermann Gruber, Markus Holzer, Michael Tautschnig
Added 25 May 2010
Updated 25 May 2010
Type Conference
Year 2009
Where WIA
Authors Hermann Gruber, Markus Holzer, Michael Tautschnig
Comments (0)