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
Pages141-152
Number of pages12
Volume3845 LNCS
Publication statusPublished - 2006 Jun 23
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

Fingerprint

Finite State Automata
Regular Expressions
Finite automata
Elimination
Eliminate
Horizontal
Vertical
Structural properties
Structural Properties
Intuitive
Heuristics
Computing

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

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 (Vol. 3845 LNCS, pp. 141-152). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3845 LNCS).
Han, Yo Sub ; Wood, Derick. / Shorter regular expressions from finite-state automata. Implementation and Application of Automata - 10th International Conference, CIAA 2005, Revised Selected Papers. Vol. 3845 LNCS 2006. pp. 141-152 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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",
month = "6",
day = "23",
language = "English",
isbn = "3540310231",
volume = "3845 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "141--152",
booktitle = "Implementation and Application of Automata - 10th International Conference, CIAA 2005, Revised Selected Papers",

}

Han, YS & Wood, D 2006, Shorter regular expressions from finite-state automata. in Implementation and Application of Automata - 10th International Conference, CIAA 2005, Revised Selected Papers. vol. 3845 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3845 LNCS, pp. 141-152, 10th International Conference on Implementation and Application of Automata, CIAA 2005, Sophia Antipolis, France, 05/6/27.

Shorter regular expressions from finite-state automata. / Han, Yo Sub; Wood, Derick.

Implementation and Application of Automata - 10th International Conference, CIAA 2005, Revised Selected Papers. Vol. 3845 LNCS 2006. p. 141-152 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3845 LNCS).

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

TY - GEN

T1 - Shorter regular expressions from finite-state automata

AU - Han, Yo Sub

AU - Wood, Derick

PY - 2006/6/23

Y1 - 2006/6/23

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33745121813&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745121813&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540310231

SN - 9783540310235

VL - 3845 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 141

EP - 152

BT - Implementation and Application of Automata - 10th International Conference, CIAA 2005, Revised Selected Papers

ER -

Han YS, Wood D. Shorter regular expressions from finite-state automata. In Implementation and Application of Automata - 10th International Conference, CIAA 2005, Revised Selected Papers. Vol. 3845 LNCS. 2006. p. 141-152. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).