On minimizing cover automata for finite languages in O(n log n) time

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

Volumn 2608, Issue , 2003, Pages 117-127

  Körner, Heiko ^a  

^a NONE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ROBOTS;

COVER AUTOMATA; DETERMINISTIC FINITE AUTOMATA; FINITE LANGUAGES;

FINITE AUTOMATA;

EID: 21144455013     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44977-9_11     Document Type: Article

References (6)

1. Câmpeanu, C., Sântean, N., Yu, S.: Minimal Cover-Automata for Finite Languages. In: Champarnaud, J.-M., Maurel, D., Ziadi, D. (eds.): Third International Workshop on Implementing Automata (WIA'98). Lecture Notes in Computer Science, Vol. 1660. Springer-Verlag, Berlin Heidelberg New York (1998) 32-42
2. Câmpeanu, C., Pǎun, A., Yu, S.: An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages. International Journal of Foundations of Computer Science (2000), to appear
3. 2) Algorithm for Constructing Minimal Cover Automata for Finite Languages. In: Yu, S., Pǎun, A. (eds.): Implementation and Application of Automata (CIAA 2000). Lecture Notes in Computer Science, Vol. 2088. Springer-Verlag, Berlin Heidelberg New York (2000) 243-251
4. Corman, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)
5. Hopcroft, J.E.: An n log n algorithm for minimizing the states in a finite automaton. In: Kohavi, Z., Paz. A. (eds.): The Theory of Machines and Computations. Academic Press, New York (1971) 189-196
6. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, MA (1979)