Incremental construction of minimal deterministic finite cover automata

Theoretical Computer Science

Volumn 363, Issue 2, 2006, Pages 135-148

  Câmpeanu, Cezar ^a   Pǎun, Andrei ^b   Smith, Jason R ^b  

^a UNIVERSITY OF PRINCE EDWARD ISLAND   (Canada)

^b LOUISIANA TECH UNIVERSITY   (United States)

Author keywords

Deterministic Finite Cover Automata (DFCA); DFA; DFCA minimization; Incremental construction

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FORMAL LANGUAGES; OPTIMIZATION;

DETERMINISTIC FINITE AUTOMATA (DFA); DETERMINISTIC FINITE COVER AUTOMATA (DFCA); DFCA MINIMIZATION; INCREMENTAL CONSTRUCTION;

FINITE AUTOMATA;

EID: 33749245153     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.07.020     Document Type: Article

References (22)

1. Câmpeanu C., and Pǎun A. Counting the number of minimal DFCA obtained by merging states. Internat. J. Found. Comput. Sci. 14 6 (2003) 995-1006
2. C. Câmpeanu, A. Pǎun, Lower bounds for NFA to DFCA transformations, in: Proc. DFCS 2004, London Ont., Canada, 2004, pp. 121-130.
3. Câmpeanu C., Pǎun A., and Kari L. Results on transforming NFA into DFCA. Fund. Inform. 64 1-4 (2005) 53-63
4. Câmpeanu C., Pǎun A., and Yu S. An efficient algorithm for constructing minimal cover automata for finite languages. Internat. J. Found. Comput. Sci. 13 1 (2002) 83-97
5. Câmpeanu C., Sântean N., and Yu S. Finite languages and cover automata. Theoret. Comput. Sci. 267 1-2 (2001) 3-16
6. Carrasco R.C., and Forcada M.L. Incremental construction and maintenance of minimal finite-state automata. Comput. Linguistics 28 2 (2002) 207-216
7. J. Daciuk, Comparison of construction algorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings, in: Proc. Seventh Internat. Conf. on Implementation and Application of Automata CIAA 2002, Tours, France, 2002, Lecture Notes in Computer Science, Vol. 2608, 2003, pp. 255-261.
8. Daciuk J., Mihov S., Watson B., and Watson R.E. Incremental construction of minimal acyclic finite state automata. Comput. Linguistics 26 1 (2000) 3-16
9. Hopcroft J.E., Ullman J.D., and Motwani R. Introduction to Automata Theory, Languages and Computation (2000), Addison-Wesley, Reading, MA
10. K'́orner H. A time and space efficient algorithm for minimizing cover automata for finite languages. Internat. J. Found. Comput. Sci. 14 6 (2003) 1071-1086
11. S. Mihov, Direct construction of minimal acyclic finite states automata, Ann. de l'Université de Sofia "St. Kl. Ohridski", Faculté de Mathematique et Informatique, Vol. 92, l.2, Sofia, Bulgaria, 1998.
12. 2) algorithm for minimal cover-automata for finite languages, in: Proc. Fifth Internat. Conf. on Implementation and Application of Automata Implementing Automata CIAA'00, 2000, pp. 243-251.
13. Salomaa A. Formal Languages (1973), Academic Press, New York
14. N. Sântean, Towards a minimal representation for finite languages: theory and practice, M.Sc. Thesis, Department of Computer Science, The University of Western Ontario, 2000.
15. Sgarbas K.N., Fakotakis N.D., and Kokkinakis G.K. Two algorithms for incremental construction of directed acyclic word graphs. Internat. J. Artif Intell. Tools 4 3 (1995) 369-381
16. Sgarbas K.N., Fakotakis N.D., and Kokkinakis G.K. Optimal insertion in deterministic DAWGs. Theoret. Comput. Sci. 301(1)(3) (2003) 103-117
17. The Grail + Project. A symbolic computation environment for finite state machines, regular expressions, and finite languages. Available online at the following address: 〈http://www.csd.uwo.ca/research/grail/〉.
18. Watson B.W. A taxonomy of finite automata minimization algorithms. Eindhoven University of Technology, The Netherlands, Computing Science Note 93/44 (1993)
19. B.W. Watson, Taxonomies and Toolkits of Regular Language Algorithms, Ph.D. Thesis, Eindhoven University of Technology, The Netherlands, 1995.
20. B.W. Watson, An incremental DFA minimization algorithm, Finite State Methods in Natural Language Processing, ESSLLI Workshop, Helsinki, Finland, August, 2001, pp. 20-24.
21. Watson B.W., and Daciuk J. An efficient incremental DFA minimization algorithm. Natural Language Eng. 9 1 (2003) 49-64
22. Yu S. Regular languages. In: Rozenberg G., and Salomaa A. (Eds). Handbook of Formal Languages Vol. I (1997), Springer, Berlin 41-110