@inproceedings{2cd8f706d1fe4724a35c2d7adc00ded8,
title = "Shorter regular expressions from finite-state automata",
abstract = "We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regular expressions from finite-state automata, the resulting regular expressions are often very long and complicated. We examine the minimization of finite-state automata to obtain shorter expressions first. Then, we introduce vertical chopping based on bridge states and horizontal chopping based on the structural properties of given finite-state automata. We prove that we should not eliminate bridge states until we eliminate all non-bridge states to obtain shorter regular expressions. In addition, we suggest heuristics for state elimination that lead to shorter regular expressions based on vertical chopping and horizontal chopping. Note that we have omitted almost all proofs in this preliminary version.",
author = "Han, {Yo Sub} and Derick Wood",
year = "2006",
doi = "10.1007/11605157_12",
language = "English",
isbn = "3540310231",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "141--152",
booktitle = "Implementation and Application of Automata - 10th International Conference, CIAA 2005, Revised Selected Papers",
address = "Germany",
note = "10th International Conference on Implementation and Application of Automata, CIAA 2005 ; Conference date: 27-06-2005 Through 29-06-2005",
}