Implementation of state elimination using heuristics

Jae Hee Ahn; Yo Sub Han

doi:10.1007/978-3-642-02979-0_21

Implementation of state elimination using heuristics

Jae Hee Ahn, Yo Sub Han

College of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Implementation and Application of Automata - 14th International Conference, CIAA 2009, Proceedings
Pages	178-187
Number of pages	10
DOIs	https://doi.org/10.1007/978-3-642-02979-0_21
Publication status	Published - 2009
Event	14th International Conference on Implementation and Application of Automata, CIAA 2009 - Sydney, NSW, Australia Duration: 2009 Jul 14 → 2009 Jul 17

Publication series

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

Other

Other	14th International Conference on Implementation and Application of Automata, CIAA 2009
Country/Territory	Australia
City	Sydney, NSW
Period	09/7/14 → 09/7/17

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

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

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

@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",

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",

note = "14th International Conference on Implementation and Application of Automata, CIAA 2009 ; Conference date: 14-07-2009 Through 17-07-2009",

}

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 proceeding › Conference contribution

TY - GEN

T1 - Implementation of state elimination using heuristics

AU - Ahn, Jae Hee

AU - Han, Yo Sub

PY - 2009

Y1 - 2009

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

T2 - 14th International Conference on Implementation and Application of Automata, CIAA 2009

Y2 - 14 July 2009 through 17 July 2009

ER -

Implementation of state elimination using heuristics

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this