Shorter regular expressions from finite-state automata

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

Volumn 3845 LNCS, Issue , 2006, Pages 141-152

  Han, Yo Sub ^a   Wood, Derick ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; HEURISTIC METHODS; OPTIMIZATION; STATE ESTIMATION;

BRIDGE STATES; HORIZONTAL CHOPPING; REGULAR EXPRESSIONS; STATE ELIMINATION;

FINITE AUTOMATA;

EID: 33745121813     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11605157_12     Document Type: Conference Paper

References (14)

1. Kleene, S.: Representation of events in nerve nets and finite automata. In Shannon, C., McCarthy, J., eds.: Automata Studies, Princeton, NJ, Princeton University Press (1956) 3-42
2. Thompson, K.: Regular expression search algorithm. Communications of the ACM 11 (1968) 419-422
3. Glushkov, V.: The abstract theory of automata. Russian Mathematical Surveys 16 (1961) 1-53
4. McNaughton, R., Yaraada, H.: Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers 9 (1960) 39-47
5. Ilie, L., Yu, S.: Follow automata. Information and Computation 186 (2003) 140-162
6. Giammarresi, D., Ponty, J.L., Wood, D., Ziadi, D.: A characterization of Thompson digraphs. Discrete Applied Mathematics 134 (2004) 317-337
7. Caron, P., Ziadi, D.: Characterization of Glushkov automata. Theoretical Computer Science 233 (2000) 75-90
8. Eilenberg, S.: Automata, Languages, and Machines. Volume A. Academic Press, New York, NY (1974)
9. Brzozowski, J., McCluskey, Jr., E.: Signal flow graph techniques for sequential circuit state diagrams. IEEE Transactions on Electronic Computers EC-12 (1963) 67-76
10. Wood, D.: Theory of Computation. John Wiley & Sons, Inc., New York, NY (1987)
11. Han, Y.S., Wood, D.: The generalization of generalized automata: Expression automata. In: Proceedings of CIAA'04, Springer-Verlag (2004) 156-166 Lecture Notes in Computer Science 3317.
12. Delgado, M., Morals, J.: Approximation to the smallest regular expression for a given regular language. In: Proceedings of CIAA'04, Springer-Verlag (2004) 312-314 Lecture Notes in Computer Science 3317.
13. Ilie, L., Navarro, G., Yu, S.: On NFA reductions. In Karhumaki, J., Maurer, H., Paun, G., Rozenberg, G., eds.: Theory is Forever (Salomaa Festschrift). Lecture Notes in Computer Science 3113, Springer-Verlag, Heidelberg (2004) 112-124
14. Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM Journal on Computing 22 (1993) 1117-1141