A time and space efficient algorithm for minimizing cover automata for finite languages

International Journal of Foundations of Computer Science

Volumn 14, Issue 6, 2003, Pages 1071-1086

  Körner, Heiko ^a  

^a NONE   (Germany)

Author keywords

Cover Language; Deterministic Cover Automata; Deterministic Finite Automata; Efficient Algorithm; Finite languages

Indexed keywords

EID: 16244365953     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054103002187     Document Type: Conference Paper

References (7)

1. C. Campeanu, N. Santean and S. Yu, "Minimal Cover-Automata for Finite Languages," in Proc. 3rd Int. Workshop on Implementing Automata (WIA'98), eds. J.-M. Champarnaud, D. Maurel and D. Ziadi (France, Rouen, 1998), Lecture Notes in Comput. Sci. 1660 (1998) 32-42.
2. C. Campeanu and A. Paun, "The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata," in Proc. 7th Int. Conference on Implementation and Application of Automata (CIAA 2002), eds. J.-M. Champarnaud and D. Maurel (France, Tours, 2002), 71-80.
3. C. Campeanu, A. Paun and S. Yu, "An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages," Int. J. Foundations of Comput. Sci. 13(1) (2000) 83-97.
4. A. Paun, N. Santean and S. Yu, "An 0(ra2) Algorithm for Constructing Minimal Cover Automata for Finite Languages," in Proc. Implementation and Application of Automata (CIAA 2000), eds. S. Yu and A. Paun (London, Ontario, Canada, 2000), Lecture Notes in Comput. Sci. 2088 (2000) 243-251.
5. T.H. Corman, C.E. Leiserson and R.L. Rivest, "Introduction to Algorithms" (MIT Press, Cambridge, 1990).
6. J.E. Hopcroft, "An nlogn algorithm for minimizing the states in a finite automaton," in The Theory of Machines and Computations, eds. Z. Kohavi and A. Paz (Academic Press, New York, 1971) 189-196.
7. J.E. Hopcroft and J.D. Ullman, "Introduction to Automata Theory, Languages and Computation" (Addison-Wesley, Reading, MA, 1979).