Shorter regular expressions from finite-state automata

Yo Sub Han, Derick Wood

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationImplementation and Application of Automata - 10th International Conference, CIAA 2005, Revised Selected Papers
PublisherSpringer Verlag
Pages141-152
Number of pages12
ISBN (Print)3540310231, 9783540310235
DOIs
Publication statusPublished - 2006
Event10th International Conference on Implementation and Application of Automata, CIAA 2005 - Sophia Antipolis, France
Duration: 2005 Jun 272005 Jun 29

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3845 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th International Conference on Implementation and Application of Automata, CIAA 2005
CountryFrance
CitySophia Antipolis
Period05/6/2705/6/29

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Shorter regular expressions from finite-state automata'. Together they form a unique fingerprint.

  • Cite this

    Han, Y. S., & Wood, D. (2006). Shorter regular expressions from finite-state automata. In Implementation and Application of Automata - 10th International Conference, CIAA 2005, Revised Selected Papers (pp. 141-152). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3845 LNCS). Springer Verlag. https://doi.org/10.1007/11605157_12