1. 1. Daciuk J. 2000. Experiments with Automata Compression. Proceedings of CIAA - Implementation and Application of Automata, London, Ontario, Canada, 105–112
2. 2. Daciuk J., Mihov S., Watson B., Watson R. 2000. Incremental Construction of Minimal Acyclic Finite State Automata. Computational Linguistics, 26(1), pages 3–16
3. 3. Drozdzyński, W., Krieger H-U., Piskorski, J., Schäfer, U., Xu, F. Shallow Processing with Uni.cation and Typed Feature Structures — Foundations and Applications. In Künstliche Intelligenz, 2004(1), pages 17–23
4. 4. Dan Gus.eld 1997). Algorithms on Strings, Trees, and Sequences. Cambridge University Press.
5. 5. Hopcroft J. 1971. An nlogn Algorithm for Minimizing the states in a Finite Automaton. The Theory of Machines and Computations, Academic Press, 189–196.