An o(n2) algorithm for constructing minimal cover automata for finite languages

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

Volumn 2088, Issue , 2001, Pages 243-251

  PĂUn, Andrei ^a   Sântean, Nicolae ^a   Yu, Sheng ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COVER AUTOMATA; DETERMINISTIC FINITE COVER AUTOMATON; FINITE LANGUAGES; NUMBER OF STATE; TIME COMPLEXITY; TRANSFORMATION ALGORITHM;

FINITE AUTOMATA;

EID: 84954431838     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44674-5_20     Document Type: Conference Paper

References (6)

1. C. Campeanu, N. Santean, S. Yu, “Minimal Cover-Automata for Finite Languages”, Proceedings of the Third International Workshop on Implementing Automata (WIA'98) 1998, 32-42.
2. J.-M. Champarnaud and D. Maurel, Automata Implementation, Third International Workshop on Implementing Automata, LNCS 1660, Springer, 1999.
3. C. Dwork and L. Stockmeyer, “A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata", SIAM Journal on Computing, vol.19 (1990) 1011-1023.
4. J. Kaneps, R. Frievalds, “Running Time to Recognize Non-Regular Languages by 2-Way Probabilistic Automata", in ICALP'91, LNCS, Springer-Verlag, New-York/Berlin (1991) vol 510, 174-185.
5. N. Santean, Towards a Minimal Representation for Finite Languages: Theory and Practice, MSc Thesis, Department of Computer Science, The University of Western Ontario, 2000.
6. D. Wood and S. Yu, Automata Implementation, Second International Workshop on Implementing Automata, LNCS 1436, Springer, 1998.