SIAM Journal on Computing
Characterization of Glushkov automata
Theoretical Computer Science
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Automata, Languages, and Machines
Automata, Languages, and Machines
Theory of Computation: A Primer
Theory of Computation: A Primer
Information and Computation
A characterization of Thompson digraphs
Discrete Applied Mathematics
The generalization of generalized automata: expression automata
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Approximation to the smallest regular expression for a given regular language
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Inference of concise DTDs from XML data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Overlap-Free regular languages
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
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.