State Elimination Ordering Strategies: Some Experimental Results
Formal Languages and Automata Theory
2010-08-11 v1
Abstract
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to regular expressions have an exponential blow-up in the worst-case. To overcome this, simple heuristic methods have been proposed. In this paper we analyse some of the heuristics presented in the literature and propose new ones. We also present some experimental comparative results based on uniform random generated deterministic finite automata.
Keywords
Cite
@article{arxiv.1008.1656,
title = {State Elimination Ordering Strategies: Some Experimental Results},
author = {Nelma Moreira and Davide Nabais and Rogério Reis},
journal= {arXiv preprint arXiv:1008.1656},
year = {2010}
}
Comments
In Proceedings DCFS 2010, arXiv:1008.1270