论文信息 - Incremental Construction of Finite-State Automata - 字舞流文

Incremental Construction of Finite-State Automata

Rozdzial przedstawia algorytmy przyrostowego i polprzyrostowego tworzenia minimalnych deterministycznych automatow skonczonych.

[1] Denis Maurel,et al. Incremental and Semi-incremental Construction of Pseudo-Minimal Automata , 2005, CIAA.

[2] John E. Hopcroft,et al. An n log n algorithm for minimizing states in a finite automaton , 1971 .

[3] Bruce W. Watson,et al. An efficient incremental DFA minimization algorithm , 2003, Natural Language Engineering.

[4] Mikel L. Forcada,et al. Incremental Construction of Minimal Tree Automata , 2009, Algorithmica.

[5] Mikel L. Forcada,et al. Incremental Construction and Maintenance of Minimal Finite-State Automata , 2002, CL.

[6] Sebastian Deorowicz,et al. How to squeeze a lexicon , 2001, Softw. Pract. Exp..

[7] Bruce W. Watson. A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs , 1998, Workshop on Implementing Automata.

[8] Jan Daciuk. Semi-incremental Addition of Strings to a Cyclic Finite Automaton , 2004, Intelligent Information Systems.

[9] Jan Daciuk. Comments on Incremental Construction and Maintenance of Minimal Finite-State Automata, by Rafael C. Carrasco and Mikel L. Forcada , 2004, Computational Linguistics.