Provably Shorter Regular Expressions from Deterministic Finite Automata

@inproceedings{Gruber2008ProvablySR,
  title={Provably Shorter Regular Expressions from Deterministic Finite Automata},
  author={Hermann Gruber and Markus Holzer},
  booktitle={Developments in Language Theory},
  year={2008}
}
We study the problem of finding good elimination orderings for the state elimination algorithm, which is one of the most popular algorithms for the conversion of finite automata into equivalent regular expressions. Based on graph separator techniques we are able to describe elimination strategies that remove states in large induced subgraphs that are “simple” like, e.g., independent sets or subgraphs of bounded treewidth, of the underlying automaton, that lead to regular expressions of moderate… CONTINUE READING

From This Paper

Topics from this paper.
14 Citations
32 References
Similar Papers

Similar Papers

Loading similar papers…