Abstract
We present a fast incremental algorithm for constructing minimal DFCA for a given language. Since it was shown that the DFCA for a language L can have less states than the DFA for L, this technique seems to be the best choice for incrementally building the automaton for a large language, especially when the number of states in the DFCA is significantly less than the number of states in the corresponding minimal DFA. We have implemented the proposed algorithm and have tested it against the best known DFCA minimization technique.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Carrasco, R.C., Forcada, M.L.: Incremental construction and maintenence of minimal finite-state automata. Computational Linguistics 28(2), 207–216 (2002)
Daciuk, J., Mihov, S., Watson, B., Watson, R.E.: Incremental construction of minimal acyclic finite state automata. Computational Linguistics 26(1), 3–16 (2000)
Daciuk, J.: Comparison of construction algorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol. 2608, pp. 255–261. Springer, Heidelberg (2003)
Mihov, S.: Direct construction of minimal acyclic finite states automata. Ann. de l’Université de Sofia “St. Kl. Ohridski”, Faculté de Mathematique et Informatique, Sofia, Bulgaria 92(2) (1998)
Sgarbas, K.N., Fakotakis, N.D., Kokkinakis, G.K.: Optimal insertion in deterministic DAWGs. Theoretical Computer Science 301 1(3), 103–117 (2003)
Sgarbas, K.N., Fakotakis, N.D., Kokkinakis, G.K.: Two algorithms for incremental construction of directed acyclic word graphs. International Journal on Artificial Intelligence Tools 4(3), 369–381 (1995)
Watson, B.W.: A taxonomy of finite automata minimization algorithms. Eindhoven University of Technology, The Netherlands, Computing Science Note 93(44) (1993)
Watson, B.W.: Taxonomies and Toolkits of Regular Language Algorithms. Ph.D. thesis, Eindhoven University of Technology, the Netherlands (1995)
Watson, B.W.: An incremental DFA minimization algorithm. Finite State Methods in Natural Language Processing. In: ESSLLI Workshop, Helsinki, Finland, pp. 20–24 (August 2001)
Watson, B.W., Daciuk, J.: An efficient incremental DFA minimization algorithm. Natural Language Engineering 9(1), 49–64 (2003)
Câmpeanu, C., Sântean, N., Yu, S.: Minimal cover-automata for finite languages. Theoretical Computer Science 267(1-2), 3–16 (2001)
Câmpeanu, C., Păun, A., Kari, L.: Results on transforming NFA into DFCA. Fundamenta Informaticae 64(1-4), 53–63 (2005)
Câmpeanu, C., Păun, A.: Counting the number of minimal DFCA obtained by merging states. International Journal of Foundations of Computer Science 14(6), 995–1006 (2003)
Câmpeanu, C., Păun, A.: Lower bounds for NFA to DFCA transformations. In: Proceedings of DFCS 2004, London Ontario, Canada, pp. 121–130 (2004)
Körner, H.: A time and space efficient algorithm for minimizing cover automata for finite languages. International Journal of Foundations of Computer Science 14(6), 1071–1086 (2003)
Păun, A., Sântean, N., Yu, S.: An O(n 2) algorithm for minimal cover-automata for finite languages. In: Yu, S., Păun, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 243–251. Springer, Heidelberg (2001)
Sântean, N.: Towards a Minimal Representation for Finite Languages: Theory and Practice. MSc thesis, Department of Computer Science, The University of Western Ontario, Canada (2000)
World Wide Web: The Grail+ project. A symbolic computation environment for finite-state machines, regular expressions, and finite languages (2002), http://www.csd.uwo.ca/Research/grail
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Salomaa, A.: Formal Languages. Academic Press, London (1973)
Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. I, pp. 41–110. Springer, Heidelberg (1997)
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 13(1), 83–98 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Câmpeanu, C., Păun, A., Smith, J.R. (2006). An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata. In: Farré, J., Litovsky, I., Schmitz, S. (eds) Implementation and Application of Automata. CIAA 2005. Lecture Notes in Computer Science, vol 3845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605157_8
Download citation
DOI: https://doi.org/10.1007/11605157_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31023-5
Online ISBN: 978-3-540-33097-4
eBook Packages: Computer ScienceComputer Science (R0)