Implementation of state elimination using heuristics

Jae Hee Ahn, Yo Sub Han

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

2 Citations (Scopus)

Abstract

State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression from state elimination depends on the state removal sequence. Note that it is very hard to compute the shortest regular expression for a given FA in general and we cannot avoid the exponential blow-up from state elimination. Nevertheless, we notice that we may have a shorter regular expression if we choose a good removal sequence. This observation motivates us to examine heuristics based on the structural properties of an FA and implement state elimination using the heuristics that run in polynomial time. We demonstrate the effectiveness of our algorithm by experiments.

Original languageEnglish
Title of host publicationImplementation and Application of Automata - 14th International Conference, CIAA 2009, Proceedings
Pages178-187
Number of pages10
DOIs
Publication statusPublished - 2009 Nov 2
Event14th International Conference on Implementation and Application of Automata, CIAA 2009 - Sydney, NSW, Australia
Duration: 2009 Jul 142009 Jul 17

Publication series

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

Other

Other14th International Conference on Implementation and Application of Automata, CIAA 2009
CountryAustralia
CitySydney, NSW
Period09/7/1409/7/17

Fingerprint

Regular Expressions
Finite automata
Finite State Automata
Elimination
Heuristics
Structural properties
Polynomials
Structural Properties
Blow-up
Intuitive
Polynomial time
Choose
Experiments
Demonstrate
Experiment

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Ahn, J. H., & Han, Y. S. (2009). Implementation of state elimination using heuristics. In Implementation and Application of Automata - 14th International Conference, CIAA 2009, Proceedings (pp. 178-187). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5642 LNCS). https://doi.org/10.1007/978-3-642-02979-0_21
Ahn, Jae Hee ; Han, Yo Sub. / Implementation of state elimination using heuristics. Implementation and Application of Automata - 14th International Conference, CIAA 2009, Proceedings. 2009. pp. 178-187 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{efb0097987054b0191eafdf4a110ce0c,
title = "Implementation of state elimination using heuristics",
abstract = "State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression from state elimination depends on the state removal sequence. Note that it is very hard to compute the shortest regular expression for a given FA in general and we cannot avoid the exponential blow-up from state elimination. Nevertheless, we notice that we may have a shorter regular expression if we choose a good removal sequence. This observation motivates us to examine heuristics based on the structural properties of an FA and implement state elimination using the heuristics that run in polynomial time. We demonstrate the effectiveness of our algorithm by experiments.",
author = "Ahn, {Jae Hee} and Han, {Yo Sub}",
year = "2009",
month = "11",
day = "2",
doi = "10.1007/978-3-642-02979-0_21",
language = "English",
isbn = "3642029787",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "178--187",
booktitle = "Implementation and Application of Automata - 14th International Conference, CIAA 2009, Proceedings",

}

Ahn, JH & Han, YS 2009, Implementation of state elimination using heuristics. in Implementation and Application of Automata - 14th International Conference, CIAA 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5642 LNCS, pp. 178-187, 14th International Conference on Implementation and Application of Automata, CIAA 2009, Sydney, NSW, Australia, 09/7/14. https://doi.org/10.1007/978-3-642-02979-0_21

Implementation of state elimination using heuristics. / Ahn, Jae Hee; Han, Yo Sub.

Implementation and Application of Automata - 14th International Conference, CIAA 2009, Proceedings. 2009. p. 178-187 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5642 LNCS).

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

TY - GEN

T1 - Implementation of state elimination using heuristics

AU - Ahn, Jae Hee

AU - Han, Yo Sub

PY - 2009/11/2

Y1 - 2009/11/2

N2 - State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression from state elimination depends on the state removal sequence. Note that it is very hard to compute the shortest regular expression for a given FA in general and we cannot avoid the exponential blow-up from state elimination. Nevertheless, we notice that we may have a shorter regular expression if we choose a good removal sequence. This observation motivates us to examine heuristics based on the structural properties of an FA and implement state elimination using the heuristics that run in polynomial time. We demonstrate the effectiveness of our algorithm by experiments.

AB - State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression from state elimination depends on the state removal sequence. Note that it is very hard to compute the shortest regular expression for a given FA in general and we cannot avoid the exponential blow-up from state elimination. Nevertheless, we notice that we may have a shorter regular expression if we choose a good removal sequence. This observation motivates us to examine heuristics based on the structural properties of an FA and implement state elimination using the heuristics that run in polynomial time. We demonstrate the effectiveness of our algorithm by experiments.

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

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

U2 - 10.1007/978-3-642-02979-0_21

DO - 10.1007/978-3-642-02979-0_21

M3 - Conference contribution

AN - SCOPUS:70350362101

SN - 3642029787

SN - 9783642029783

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

SP - 178

EP - 187

BT - Implementation and Application of Automata - 14th International Conference, CIAA 2009, Proceedings

ER -

Ahn JH, Han YS. Implementation of state elimination using heuristics. In Implementation and Application of Automata - 14th International Conference, CIAA 2009, Proceedings. 2009. p. 178-187. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-02979-0_21