Efficient minimization of DFAS with partial transition functions

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

Volumn , Issue , 2008, Pages 645-656

  Valmari, Antti ^a   Lehtinen, Petri ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

Deterministic finite automaton; Partition refinement; Sparse adjacency matrix

Indexed keywords

COMPUTERS;

ADJACENCY MATRICES; DETERMINISTIC FINITE AUTOMATA; MEMORY ALGORITHMS; PARTIAL FUNCTIONS; PARTITION REFINEMENT; TIME CONSUMPTION; TRANSITION FUNCTIONS; TRANSITION RELATIONS;

COMPUTER SCIENCE;

EID: 45749083751     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974.
2. Fernandez, J.-C.: An Implementation of an Efficient Algorithm for Bisimulation Equivalence. Science of Computer Programming 13 (1989/90) 219-236.
3. Gries, D.: Describing an Algorithm by Hopcroft. Acta Informatica 2 (1973) 97-109.
4. Gries, D.: The Science of Programming. Springer 1981.
5. Hopcroft, J.: An n log n Algorithm for Minimizing States in a Finite Automaton. Technical Report CS-190, Stanford University, 1970.
6. Knuutila, T.: Re-describing an Algorithm by Hopcroft. Theoret. Computer Science 250 (2001) 333-363.
7. Paige, R., Tarjan, R.: Three Partition Refinement Algorithms. SIAM J. Computing, 16 (1987) 973-989.