Short Regular Expressions from Finite Automata: Empirical Results

  • Authors:

  • Hermann Gruber;Markus Holzer;Michael Tautschnig

  • Affiliations:

  • Institut für Informatik, Universität Giessen, Giessen, Germany D-35392;Institut für Informatik, Universität Giessen, Giessen, Germany D-35392;Fachbereich Informatik, Technische Universität Darmstadt, Darmstadt, Germany D-64289

  • Venue:
  • CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended abstract). 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 expression for a given regular language. In Proc. CIAA , LNCS 3317, 2004] almost always outperforms all other strategies, including those with a provable performance guarantee.